Sciweavers

2252 search results - page 159 / 451
» Improving Random Forests
Sort
View
ICALP
2004
Springer
14 years 1 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...
CN
2000
109views more  CN 2000»
13 years 8 months ago
On near-uniform URL sampling
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 2 months ago
Delay Optimization in Cooperative Relaying with Cyclic Delay Diversity
— Cooperative relaying has recently been recognized as an alternative to MIMO in a typical multi cellular environment. Inserting random delays at the non-regenerative fixed rela...
S. Ben Slimane, Xuesong Li, Bo Zhou, Nauroze Syed,...
MLMI
2007
Springer
14 years 2 months ago
Conditional Sequence Model for Context-Based Recognition of Gaze Aversion
Eye gaze and gesture form key conversational grounding cues that are used extensively in face-to-face interaction among people. To accurately recognize visual feedback during inter...
Louis-Philippe Morency, Trevor Darrell
ACG
2006
Springer
14 years 2 months ago
Move-Pruning Techniques for Monte-Carlo Go
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...
Bruno Bouzy