Sciweavers

338 search results - page 24 / 68
» Approximation Spaces and Information Granulation
Sort
View
ICARCV
2006
IEEE
126views Robotics» more  ICARCV 2006»
15 years 3 months ago
Improvement to the Minimization of Hybrid Error Functions for Pose Alignment
— Many problems in computer vision such as pose recovery and structure estimation are formulated as a minimization process. These problems vary in the use of image measurements d...
A. H. Abdul Hafez, C. V. Jawahar
ISCC
2006
IEEE
123views Communications» more  ISCC 2006»
15 years 3 months ago
Similarity Search in a Hybrid Overlay P2P Network
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...
Mouna Kacimi, Kokou Yétongnon
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
14 years 7 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
CVPR
2012
IEEE
12 years 12 months ago
Boosting algorithms for simultaneous feature extraction and selection
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
Mohammad J. Saberian, Nuno Vasconcelos
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 2 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen