Publications

Search
Export 11 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is Polynomials  [Clear All Filters]
2011
Zhang Z, Klassen E, Srivastava A, Turaga P, Chellappa R.  2011.  Blurring-invariant Riemannian metrics for comparing signals and images. 2011 IEEE International Conference on Computer Vision (ICCV). :1770-1775.
Li J, Deshpande A.  2011.  Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). :797-806.
2010
Haeupler B, Saha B, Srinivasan A.  2010.  New Constructive Aspects of the Lovasz Local Lemma. 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). :397-406.
2009
Li J, Deshpande A, Khuller S.  2009.  Minimizing Communication Cost in Distributed Multi-query Processing. IEEE 25th International Conference on Data Engineering, 2009. ICDE '09. :772-783.
2008
Wang X, Burns R, Terzis A, Deshpande A.  2008.  Network-Aware Join Processing in Global-Scale Database Federations. IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008. :586-595.
2005
Deshpande A, Guestrin C, Hong W, Madden S.  2005.  Exploiting Correlated Attributes in Acquisitional Query Processing. 21st International Conference on Data Engineering, 2005. ICDE 2005. Proceedings. :143-154.
1999
Yacoob Y, Davis LS.  1999.  Tracking rigid motion using a compact-structure constraint. Computer Vision, 1999. The Proceedings of the Seventh IEEE International Conference on. 1:198-205vol.1-198-205vol.1.
1998
Radhakrishnan J, Srinivasan A.  1998.  Improved bounds and algorithms for hypergraph two-coloring. 39th Annual Symposium on Foundations of Computer Science, 1998. Proceedings. :684-693.
1997
Dancik V, Hannenhalli S, Muthukrishnan S.  1997.  Hardness of flip-cut problems from optical mapping [DNA molecules application]. Compression and Complexity of Sequences 1997. Proceedings. :275-284.
1994
Srinivasan A, Zuckerman D.  1994.  Computing with very weak random sources. , 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings. :264-275.
1992
Chandrasekharan N, Hannenhalli S.  1992.  Efficient algorithms for computing matching and chromatic polynomials on series-parallel graphs. , Fourth International Conference on Computing and Information, 1992. Proceedings. ICCI '92. :42-45.