Sciweavers

92 search results - page 5 / 19
» Random non-cupping revisited
Sort
View
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 9 months ago
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
Neri Merhav
ISSTA
2007
ACM
13 years 11 months ago
Experimental assessment of random testing for object-oriented software
Progress in testing requires that we evaluate the effectiveness of testing strategies on the basis of hard experimental evidence, not just intuition or a priori arguments. Random ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
EWSN
2010
Springer
14 years 6 months ago
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
Marco Zuniga, Chen Avin, Manfred Hauswirth
AIIDE
2006
13 years 11 months ago
Plausible Environment Reconstruction Using Bayesian Networks
To save precious time and space, many games and simulations use static terrain and fixed (or random) reconstruction of areas that a player leaves and later revisits. This can resu...
Robert G. Price, Scott D. Goodwin
COCOON
2007
Springer
14 years 1 months ago
An Improved Algorithm for Online Unit Clustering
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
Hamid Zarrabi-Zadeh, Timothy M. Chan