359 search results - page 30 / 72 » Online Algorithms for Disk Graphs |
WDAG
2010
Springer
14 years 10 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
112
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
104
click to vote
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
128
click to vote
DIALM
2003
ACM
15 years 5 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
104
click to vote
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...