3874 search results - page 740 / 775 » Approximation Algorithms for k-hurdle Problems |
118
click to vote
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
107
click to vote
SIGMETRICS
2011
ACM
14 years 15 days ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
100
click to vote
ICCV
2011
IEEE
13 years 9 months ago
2011
IEEE
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...