Sciweavers

53 search results - page 4 / 11
» An Efficient Boosting Algorithm for Combining Preferences
Sort
View
90
Voted
TSP
2008
151views more  TSP 2008»
14 years 9 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
CVPR
2001
IEEE
15 years 11 months ago
Rapid Object Detection using a Boosted Cascade of Simple Features
This paper describes a machine learning approach for visual object detection which is capable of processing images extremely rapidly and achieving high detection rates. This wor...
Paul A. Viola, Michael J. Jones
ECCV
2004
Springer
15 years 11 months ago
Weak Hypotheses and Boosting for Generic Object Detection and Recognition
In this paper we describe the first stage of a new learning system for object detection and recognition. For our system we propose Boosting [5] as the underlying learning technique...
Andreas Opelt, Michael Fussenegger, Axel Pinz, Pet...
CIKM
2009
Springer
15 years 4 months ago
Web search result summarization: title selection algorithms and user satisfaction
Eye tracking experiments have shown that titles of Web search results play a crucial role in guiding a user’s search process. We present a machine-learned algorithm that trains ...
Tapas Kanungo, Nadia Ghamrawi, Ki Yuen Kim, Lawren...
ECCV
2010
Springer
14 years 7 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...