3837 search results - page 487 / 768 » Learning Approximate Consistencies |
206
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
194
click to vote
COMPGEOM
2006
ACM
16 years 1 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
211
click to vote
ICALP
2004
Springer
16 years 21 days ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
218
click to vote
FUN
2010
Springer
16 years 3 days ago
2010
Springer
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
217
click to vote
ESA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...