3247 search results - page 377 / 650 » Randomized smoothing networks |
181
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
174
click to vote
PERCOM
2007
ACM
16 years 6 months ago
2007
ACM
We propose to use node mobility to enhance routing capability in a mobile network. A dual-control planes model is presented, which includes the traditional S(stationary)-plane for ...
150
click to vote
ACSAC
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—We present an efficient and robust stepping-stone detection scheme based on succinct packet-timing sketches of network flows. The proposed scheme employs an online alg...
164
click to vote
CLUSTER
2009
IEEE
16 years 1 months ago
2009
IEEE
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
177
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Medium access in ad-hoc wireless networks must be performed in a distributed fashion due to lack of coordination between nodes. Specifically, when nodes are capable of receivin...