1566 search results - page 209 / 314 » On a Cone Covering Problem |
140
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
179
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
143
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
131
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
A fundamental challenge in face recognition lies in determining what facial features are important for the identification of faces. In this paper, a novel face recognition framewo...
159
click to vote
STOC
2009
ACM
16 years 4 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...