1632 search results - page 65 / 327 » Sublinear Time Algorithms for Metric Space Problems |
134
Voted
ESA
2008
Springer
15 years 5 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
157
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
264
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
177
click to vote
VISSYM
2007
15 years 5 months ago
2007
The dataset generated by a large-scale numerical simulation may include thousands of timesteps and hundreds of variables describing different aspects of the modeled physical pheno...
121
Voted
CJ
2010
15 years 3 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...