Sciweavers

4973 search results - page 714 / 995
» Probabilistic Algorithms in Robotics
Sort
View
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 10 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
CGF
2006
136views more  CGF 2006»
15 years 6 months ago
Cache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
Sung-Eui Yoon, Dinesh Manocha
TITS
2008
262views more  TITS 2008»
15 years 6 months ago
Robust Lane Detection and Tracking in Challenging Scenarios
A lane-detection system is an important component of many intelligent transportation systems. We present a robust lane-detection-and-tracking algorithm to deal with challenging sce...
ZuWhan Kim
MVA
2007
179views Computer Vision» more  MVA 2007»
15 years 6 months ago
Multi-object trajectory tracking
The majority of existing tracking algorithms are based on the maximum a posteriori (MAP) solution of a probabilistic framework using a Hidden Markov Model, where the distribution ...
Mei Han, Wei Xu, Hai Tao, Yihong Gong
CIKM
2010
Springer
15 years 5 months ago
Ranking under temporal constraints
This paper introduces the notion of temporally constrained ranked retrieval, which, given a query and a time constraint, produces the best possible ranked list within the specifi...
Lidan Wang, Donald Metzler, Jimmy Lin