1632 search results - page 54 / 327 » Sublinear Time Algorithms for Metric Space Problems |
121
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
129
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
101
click to vote
ESA
2003
Springer
15 years 8 months ago
2003
Springer
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
88
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...
132
Voted
ESOP
2009
Springer
15 years 7 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...