248 search results - page 24 / 50 » Geometrical Probability Covering Algorithm |
STOC
2009
ACM
14 years 8 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...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
MICCAI
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Brain imaging provides a wealth of information that computers can explore at a massive scale. Categorizing the patterns of the human cortex has been a challenging issue f...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Many applications in computer vision and pattern recognition involve drawing inferences on certain manifoldvalued parameters. In order to develop accurate inference algorithms on ...