1389 search results - page 262 / 278 » Parallel Algorithms for Treewidth Two |
156
Voted
ICDCS
2006
IEEE
16 years 12 days ago
2006
IEEE
Network coordinates provide a scalable way to estimate latencies among large numbers of hosts. While there are several algorithms for producing coordinates, none account for the f...
186
Voted
IPPS
2005
IEEE
15 years 12 months ago
2005
IEEE
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
180
Voted
ICS
2005
Tsinghua U.
15 years 12 months ago
2005
Tsinghua U.
Excessive power consumption is becoming a major barrier to extracting the maximum performance from high-performance parallel systems. Therefore, techniques oriented towards reduci...
186
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
174
Voted
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...