644 search results - page 112 / 129 » A topological characterization of weakness |
102
click to vote
TMC
2012
12 years 12 months ago
2012
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
STOC
2004
ACM
15 years 9 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
MOBISYS
2006
ACM
15 years 9 months ago
2006
ACM
Multihop wireless mesh networks can provide Internet access over a wide area with minimal infrastructure expenditure. In this work, we present a measurement driven deployment stra...
105
click to vote
IWCIA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...