60 search results - page 7 / 12 » Cardinality Bounds for Triangulations with Bounded Minimum A... |
SAC
2010
ACM
14 years 1 months ago
2010
ACM
In GIS and spatial databases, cardinal directions are frequently used as selection and join criteria in query languages. However, most cardinal direction models are only able to h...
ICRA
2006
IEEE
14 years 29 days ago
2006
IEEE
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
COMPGEOM
2010
ACM
14 years 7 hour ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
DM
2010
13 years 7 months ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
DM
2008
13 years 7 months ago
2008
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...