1370 search results - page 137 / 274 » On grids in topological graphs |
139
click to vote
DCOSS
2005
Springer
16 years 3 hour ago
2005
Springer
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
163
click to vote
WABI
2005
Springer
15 years 12 months ago
2005
Springer
We present recent developments in efficiently maintaining the boundary and surface area of protein molecules as they undergo conformational changes. As the method that we devised k...
150
click to vote
COLING
2008
15 years 8 months ago
2008
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
148
click to vote
ISCAPDCS
2007
15 years 8 months ago
2007
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
185
click to vote
TWC
2010
15 years 1 months ago
2010
In wireless ad hoc networks, relative neighborhood graphs (RNGs) are widely used for topology control. If every node has the same transmission radius, then an RNG can be locally co...