1632 search results - page 27 / 327 » Sublinear Time Algorithms for Metric Space Problems |
106
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
244
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
124
click to vote
JUCS
2008
15 years 3 months ago
2008
: A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. "Ru...
188
Voted
AI
1998
Springer
15 years 7 months ago
1998
Springer
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
137
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...