215 search results - page 35 / 43 » Approximating Geometrical Graphs via |
128
click to vote
AINA
2007
IEEE
15 years 8 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
126
click to vote
KDD
1997
ACM
15 years 6 months ago
1997
ACM
In this paper 1 we present a method for discovering approximately common motifs (also known as active motifs) in three dimensional (3D) molecules. Each node in a molecule is repre...
ICRA
2010
IEEE
15 years 12 days ago
2010
IEEE
— We present a novel approach to build approximate maps of structured environments utilizing human motion and activity. Our approach uses data recorded with a data suit which is ...
102
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
114
Voted
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...