Sciweavers

343 search results - page 27 / 69
» Estimating routing congestion using probabilistic analysis
Sort
View
SPAA
1996
ACM
13 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
DSN
2007
IEEE
14 years 1 months ago
Concilium: Collaborative Diagnosis of Broken Overlay Routes
In a peer-to-peer overlay network, hosts cooperate to forward messages. When a message does not reach its final destination, there are two possible explanations. An intermediate ...
James W. Mickens, Brian D. Noble
TASLP
2010
117views more  TASLP 2010»
13 years 2 months ago
Speech Enhancement Using Gaussian Scale Mixture Models
This paper presents a novel probabilistic approach to speech enhancement. Instead of a deterministic logarithmic relationship, we assume a probabilistic relationship between the fr...
Jiucang Hao, Te-Won Lee, Terrence J. Sejnowski
GLVLSI
2007
IEEE
194views VLSI» more  GLVLSI 2007»
13 years 11 months ago
Probabilistic maximum error modeling for unreliable logic circuits
Reliability modeling and evaluation is expected to be one of the major issues in emerging nano-devices and beyond 22nm CMOS. Such devices would have inherent propensity for gate f...
Karthikeyan Lingasubramanian, Sanjukta Bhanja
DRR
2003
13 years 8 months ago
Information retrieval for OCR documents: a content-based probabilistic correction model
The difficulty with information retrieval for OCR documents lies in the fact that OCR documents comprise of a significant amount of erroneous words and unfortunately most informat...
Rong Jin, ChengXiang Zhai, Alexander G. Hauptmann