Sciweavers

806 search results - page 21 / 162
» Lower Bounds on Correction Networks
Sort
View
NIPS
1998
13 years 9 months ago
Inference in Multilayer Networks via Large Deviation Bounds
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
Michael J. Kearns, Lawrence K. Saul
23
Voted
SIAMCOMP
1998
162views more  SIAMCOMP 1998»
13 years 7 months ago
Hypercubic Sorting Networks
Hypercubic sorting networks are a class of comparator networks whose structure maps e ciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic...
Frank Thomson Leighton, C. Greg Plaxton
EUROPAR
2005
Springer
14 years 1 months ago
New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
TWC
2011
367views more  TWC 2011»
13 years 2 months ago
Improving the Performance of Wireless Ad Hoc Networks Through MAC Layer Design
—In this paper, the performance of the ALOHA and CSMA MAC protocols are analyzed in spatially distributed wireless networks. The main system objective is correct reception of pac...
Mariam Kaynia, Nihar Jindal, Geir E. Øien
WDAG
1992
Springer
104views Algorithms» more  WDAG 1992»
13 years 11 months ago
Choice Coordination with Multiple Alternatives (Preliminary Version)
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang