Sciweavers

872 search results - page 32 / 175
» Extreme lower probabilities
Sort
View
104
Voted
ICC
2008
IEEE
142views Communications» more  ICC 2008»
15 years 7 months ago
Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
Han Cai, Do Young Eun
JCT
2011
84views more  JCT 2011»
14 years 7 months ago
Enumerating isodiametric and isoperimetric polygons
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
Michael J. Mossinghoff
99
Voted
COCOON
2007
Springer
15 years 6 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang
80
Voted
ORL
2008
88views more  ORL 2008»
15 years 12 days ago
Approximating integrals of multivariate exponentials: A moment approach
We propose a method to calculate lower and upper bounds of some exponential multivariate integrals using moment relaxations and show that they asymptotically converge to the value...
Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasser...
126
Voted
CORR
2006
Springer
141views Education» more  CORR 2006»
15 years 15 days ago
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input outp...
Chun-Hao Hsu, Achilleas Anastasopoulos