306 search results - page 60 / 62 » Parallel approximation algorithms for facility-location prob... |
147
click to vote
ICDCN
2009
Springer
15 years 9 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
123
Voted
WWW
2005
ACM
16 years 3 months ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
118
Voted
IPPS
2010
IEEE
15 years 13 days ago
2010
IEEE
Abstract--The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov C...
140
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...
127
Voted
SRDS
2008
IEEE
15 years 9 months ago
2008
IEEE
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...