4744 search results - page 201 / 949 » Connected Computing |
127
Voted
ESA
1998
Springer
15 years 7 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
142
Voted
CGF
2002
15 years 3 months ago
2002
A way to create effective stylized line drawings is to draw strokes that start and stop at visible portions along the silhouette of an object to be portrayed. In computer graphics...
161
Voted
IWCMC
2006
ACM
15 years 9 months ago
2006
ACM
Due to the growing interest in mobile wireless Ad-Hoc networks’ (MANETs) applications, researchers have proposed many routing protocols that differ in their objective. Energy ef...
139
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
125
Voted
TWC
2008
15 years 3 months ago
2008
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...