Sciweavers

297 search results - page 18 / 60
» Every Sequence Is Decompressible from a Random One
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
Randomized trees for human pose detection
This paper addresses human pose recognition from video sequences by formulating it as a classification problem. Unlike much previous work we do not make any assumptions on the ava...
Grégory Rogez, Jonathan Rihan, Srikumar Ram...
SIGECOM
2008
ACM
158views ECommerce» more  SIGECOM 2008»
14 years 11 months ago
Information revelation and random entry in sequential ascending auctions
We examine a model in which multiple buyers with single-unit demand are faced with an infinite sequence of auctions. New buyers arrive on the market probabilistically, and are each...
Maher Said
ECCV
2000
Springer
16 years 25 days ago
Quasi-Random Sampling for Condensation
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...
Vasanth Philomin, Ramani Duraiswami, Larry S. Davi...
BMCBI
2007
147views more  BMCBI 2007»
14 years 11 months ago
Bias in random forest variable importance measures: Illustrations, sources and a solution
Variable importance measures for random forests have been receiving increased attention as a means of variable selection in many classification tasks in bioinformatics and relate...
Carolin Strobl, Anne-Laure Boulesteix, Achim Zeile...
SIAMDM
2008
84views more  SIAMDM 2008»
14 years 11 months ago
Long Local Searches for Maximal Bipartite Subgraphs
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
Hemanshu Kaul, Douglas B. West