Sciweavers

323 search results - page 27 / 65
» New Algorithms for Learning in Presence of Errors
Sort
View
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 10 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
CIVR
2010
Springer
204views Image Analysis» more  CIVR 2010»
14 years 11 days ago
Utilizing related samples to learn complex queries in interactive concept-based video search
One of the main challenges in interactive concept-based video search is the insufficient relevant sample problem, especially for queries with complex semantics. To address this pr...
Jin Yuan, Zheng-Jun Zha, Zhengdong Zhao, Xiangdong...
IJRR
2011
159views more  IJRR 2011»
13 years 3 months ago
Learning visual representations for perception-action systems
We discuss vision as a sensory modality for systems that effect actions in response to perceptions. While the internal representations informed by vision may be arbitrarily compl...
Justus H. Piater, Sébastien Jodogne, Renaud...
ICCV
2001
IEEE
14 years 10 months ago
Visual Servoing Invariant to Changes in Camera Intrinsic Parameters
This paper presents a new visual servoing scheme which is invariant to changes in camera intrinsic parameters. Current visual servoing techniques are based on the learning of a ref...
Ezio Malis
COLT
2008
Springer
13 years 10 months ago
On the Margin Explanation of Boosting Algorithms
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
Liwei Wang, Masashi Sugiyama, Cheng Yang, Zhi-Hua ...