3008 search results - page 426 / 602 » Independence in connected graphs |
197
click to vote
BVAI
2005
Springer
16 years 13 days ago
2005
Springer
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
178
click to vote
DIALM
2004
ACM
16 years 12 days ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
173
click to vote
DMSN
2004
ACM
16 years 12 days ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
180
click to vote
SC
2004
ACM
16 years 12 days ago
2004
ACM
This work describes a technique for improving network performance in Grid environments that we refer to as “logistics.” We demonstrate that by using storage and cooperative fo...
183
click to vote
SENSYS
2004
ACM
16 years 12 days ago
2004
ACM
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...