5948 search results - page 202 / 1190 » Computing Robust Counter-Strategies |
122
click to vote
LOCA
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we present a robust, decentralized approach to RF-based location tracking. Our system, called MoteTrack, is based on low-power radio transceivers coupled with a mode...
166
click to vote
SWAT
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
110
Voted
MFCS
1995
Springer
15 years 7 months ago
1995
Springer
In AS , we de ned a notion of measure on the complexity class P in the spirit of the work of Lutz L92 that provides a notion of measure on complexity classes at least as large as...
155
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
140
click to vote
CGF
2010
15 years 3 months ago
2010
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...