85 search results - page 4 / 17 » Improved Algorithms for Uniform Partitions of Points |
STOC
2004
ACM
15 years 9 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
PAMI
2011
14 years 4 months ago
2011
—This paper addresses the issue of matching rigid and articulated shapes through probabilistic point registration. The problem is recast into a missing data framework where unkno...
SIGCOMM
2009
ACM
15 years 4 months ago
2009
ACM
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
—This paper describes two directed intervention crossover approaches that are applied to a bio-control dynamic system. Unlike traditional uniform crossover, both the Calculated E...
ALGORITHMICA
2010
14 years 9 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...