3247 search results - page 76 / 650 » Randomized smoothing networks |
112
Voted
ICCCN
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—CAN is a well-known DHT technique for contentbased P2P networks, where each node is assigned a zone in a virtual coordinate space to store the index of the data hashed i...
136
Voted
ASPDAC
2007
ACM
15 years 7 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
113
Voted
TIT
2011
14 years 10 months ago
2011
We consider a dense K user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural condi...
187
Voted
TMC
2012
13 years 6 months ago
2012
—We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying...
102
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...