1632 search results - page 220 / 327 » Sublinear Time Algorithms for Metric Space Problems |
150
click to vote
COMGEO
2011
ACM
14 years 11 months ago
2011
ACM
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
121
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
115
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
112
Voted
TALG
2010
15 years 2 months ago
2010
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
129
click to vote
ISCAS
2003
IEEE
15 years 9 months ago
2003
IEEE
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...