Sciweavers

344 search results - page 27 / 69
» A constant factor approximation algorithm for a class of cla...
Sort
View
JC
2007
94views more  JC 2007»
15 years 2 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
139
Voted
CVPR
2010
IEEE
15 years 15 days ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
124
Voted
INFOCOM
2005
IEEE
15 years 8 months ago
Power aware routing for sensor databases
— Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures...
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash ...
CVPR
2009
IEEE
16 years 9 months ago
Robust Multi-Class Transductive Learning with Graphs
Graph-based methods form a main category of semisupervised learning, offering flexibility and easy implementation in many applications. However, the performance of these methods...
Wei Liu (Columbia University), Shih-fu Chang (Colu...
APPROX
2007
Springer
102views Algorithms» more  APPROX 2007»
15 years 8 months ago
Hardness of Embedding Metric Spaces of Equal Size
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
Subhash Khot, Rishi Saket