948 search results - page 150 / 190 » What can we achieve by arbitrary announcements |
CGF
2005
13 years 8 months ago
2005
In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collase/uncollapse based...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
ADHOCNOW
2009
Springer
13 years 10 months ago
2009
Springer
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
CAD
2006
Springer
13 years 8 months ago
2006
Springer
This paper presents a new unified subdivision scheme that is defined over a k-simplicial complex in n-D space with k 3. We first present a series of definitions to facilitate top...
MOBISYS
2010
ACM
13 years 11 months ago
2010
ACM
This paper develops a navigation service, called GreenGPS, that uses participatory sensing data to map fuel consumption on city streets, allowing drivers to find the most fueleffi...