599 search results - page 84 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
76
Voted
TIP
2008
14 years 9 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
96
Voted
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
ESA
2003
Springer
15 years 2 months ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
WDAG
1995
Springer
15 years 1 months ago
1995
Springer
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
88
Voted
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...