1632 search results - page 68 / 327 » Sublinear Time Algorithms for Metric Space Problems |
131
Voted
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
117
click to vote
ALGORITHMICA
2006
15 years 3 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
138
Voted
CCE
2004
15 years 3 months ago
2004
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
151
Voted
ICDT
2007
ACM
15 years 9 months ago
2007
ACM
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
126
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...