5595 search results - page 1073 / 1119 » Approximation Algorithms for Clustering Problems |
147
Voted
CVPR
2008
IEEE
16 years 4 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. ...
141
click to vote
STOC
2009
ACM
16 years 3 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...
145
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
111
Voted
SODA
2010
ACM
16 years 1 hour ago
2010
ACM
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
121
Voted
ICDT
2010
ACM
15 years 12 months ago
2010
ACM
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...