Sciweavers

1068 search results - page 26 / 214
» Extremely randomized trees
Sort
View
124
Voted
TWC
2008
112views more  TWC 2008»
15 years 1 months ago
Design and Analysis of Cross-Layer Tree Algorithms for Wireless Random Access
In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on suc...
Xin Wang, Yingqun Yu, Georgios B. Giannakis
80
Voted
JCP
2006
98views more  JCP 2006»
15 years 1 months ago
Backward Coding of Wavelet Trees with Fine-grained Bitrate Control
Backward Coding of Wavelet Trees (BCWT) is an extremely fast wavelet-tree-based image coding algorithm. Utilizing a unique backward coding algorithm, BCWT also provides a rich set ...
Jiangling Guo, Sunanda Mitra, Brian Nutter, Tanja ...
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 3 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 6 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
123
Voted
CVPR
2005
IEEE
16 years 3 months ago
Randomized Trees for Real-Time Keypoint Recognition
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...
Vincent Lepetit, Pascal Lagger, Pascal Fua