Sciweavers

3360 search results - page 241 / 672
» An Optimal Distributed Edge-Biconnectivity Algorithm
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 3 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
TIT
2002
68views more  TIT 2002»
15 years 6 months ago
A Lagrangian formulation of Zador's entropy-constrained quantization theorem
Abstract--Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd...
Robert M. Gray, Tamás Linder, Jia Li
IPPS
2010
IEEE
15 years 4 months ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé
DAC
2003
ACM
16 years 7 months ago
Distributed sleep transistor network for power reduction
Sleep transistors are effective to reduce dynamic and leakage power. The cluster-based design was proposed to reduce the sleep transistor area by clustering gates to minimize the ...
Changbo Long, Lei He
NIPS
2001
15 years 8 months ago
Constructing Distributed Representations Using Additive Clustering
If the promise of computational modeling is to be fully realized in higherlevel cognitive domains such as language processing, principled methods must be developed to construct th...
Wheeler Ruml