Sciweavers

4007 search results - page 255 / 802
» Computation with imprecise probabilities
Sort
View
SOFSEM
2009
Springer
16 years 1 months ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
Martin Dietzfelbinger, Ulf Schellbach
CIKM
2009
Springer
15 years 11 months ago
Post-rank reordering: resolving preference misalignments between search engines and end users
No search engine is perfect. A typical type of imperfection is the preference misalignment between search engines and end users, e.g., from time to time, web users skip higherrank...
Chao Liu, Mei Li, Yi-Min Wang
GLOBECOM
2008
IEEE
15 years 11 months ago
Optimal LLR Clipping Levels for Mixed Hard/Soft Output Detection
Abstract—Consider a communications system where the detector generates a mix of hard and soft outputs, which are then fed into a soft-input channel decoder. In such a setting, it...
Ernesto Zimmermann, David L. Milliner, John R. Bar...
ICAS
2006
IEEE
171views Robotics» more  ICAS 2006»
15 years 10 months ago
Adaptive Approach to Information Dissemination in Self-Organizing Grids
The size, complexity, heterogeneity, and dynamism of largescale computational grids make autonomic grid services and solutions necessary. In particular, grid schedulers must map a...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
15 years 10 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene