Sciweavers

1414 search results - page 208 / 283
» Randomness and Universal Machines
Sort
View
COLT
2010
Springer
13 years 8 months ago
Learning Rotations with Little Regret
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
Elad Hazan, Satyen Kale, Manfred K. Warmuth
COLT
2010
Springer
13 years 8 months ago
Robust Hierarchical Clustering
One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across many different fields ranging from computational...
Maria-Florina Balcan, Pramod Gupta
COLT
2010
Springer
13 years 7 months ago
Nonparametric Bandits with Covariates
We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random cov...
Philippe Rigollet, Assaf Zeevi
FGR
2011
IEEE
255views Biometrics» more  FGR 2011»
13 years 1 months ago
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
David D. Cox, Nicolas Pinto
ICPR
2000
IEEE
14 years 11 months ago
Tracking Humans from a Moving Platform
Research at the Computer Vision Laboratory at the University of Maryland has focussed on developing algorithms and systems that can look at humans and recognize their activities i...
Larry S. Davis, Vasanth Philomin, Ramani Duraiswam...