2570 search results - page 174 / 514 » Fast Algorithms For The Computation Of Ranklets |
122
Voted
AAAI
1998
15 years 4 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
128
Voted
FGR
2004
IEEE
15 years 7 months ago
2004
IEEE
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
149
Voted
DAGSTUHL
1997
15 years 4 months ago
1997
A realistic simulation system, which couples geometry and physics, can provide a useful toolkit for virtual environments. Interactions among moving objects in the virtual worlds a...
133
click to vote
PPOPP
1993
ACM
15 years 7 months ago
1993
ACM
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representati...
115
Voted
TALG
2008
15 years 3 months ago
2008
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...