2498 search results - page 443 / 500 » Algorithms for the Topological Watershed |
135
click to vote
COCOON
2007
Springer
16 years 2 days ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
146
click to vote
INFOCOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— Multihoming has been used by stub networks for several years as a form of redundancy, improving the availability of Internet access. More recently, Intelligent Route Control (I...
163
click to vote
SMA
2005
ACM
15 years 11 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
174
click to vote
STOC
2004
ACM
15 years 11 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
170
click to vote
WSNA
2003
ACM
15 years 11 months ago
2003
ACM
Efficiently self organizing a network hierarchy with specific assignment of roles (or tasks) to sensors based on their physical wireless connectivity and sensing characteristics ...