Sciweavers

2626 search results - page 467 / 526
» The complexity of stochastic sequences
Sort
View
CGF
2010
171views more  CGF 2010»
15 years 3 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 3 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
CVPR
2011
IEEE
15 years 2 months ago
Multi-agent event recognition in structured scenarios
We present a framework for the automatic recognition of complex multi-agent events in settings where structure is imposed by rules that agents must follow while performing activit...
Vlad Morariu, Larry Davis
CVPR
2011
IEEE
15 years 2 months ago
Learning Message-Passing Inference Machines for Structured Prediction
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
Stephane Ross, Daniel Munoz, J. Andrew Bagnell
CVPR
2011
IEEE
15 years 1 months ago
Scene Flow Estimation by Growing Correspondence Seeds
A simple seed growing algorithm for estimating scene flow in a stereo setup is presented. Two calibrated and synchronized cameras observe a scene and output a sequence of image p...
Jan Cech, Jordi Sanchez-Riera, Radu Horaud