9176 search results - page 393 / 1836 » algorithms 2010 |
132
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— This paper presents a solution to decentralized Voronoi coverage in non-convex polygonal environments. We show that complications arise when existing approaches to Voronoi cove...
161
Voted
SODA
2010
ACM
15 years 5 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
185
click to vote
ASIACRYPT
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
165
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
166
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We prove that relative to an oracle, there is no worst-case to average-case reduction for NP. We also handle classes that are somewhat larger than NP, as well as worst-case to err...