Sciweavers

9842 search results - page 1337 / 1969
» Problem complexity
Sort
View
ECCV
2010
Springer
14 years 1 months ago
Voting by Grouping Dependent Parts
Hough voting methods efficiently handle the high complexity of multiscale, category-level object detection in cluttered scenes. The primary weakness of this approach is however t...
Pradeep Yarlagadda, Antonio Monroy and Bjorn Ommer
JMLR
2012
13 years 10 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
JMLR
2012
13 years 10 months ago
Multi Kernel Learning with Online-Batch Optimization
In recent years there has been a lot of interest in designing principled classification algorithms over multiple cues, based on the intuitive notion that using more features shou...
Francesco Orabona, Jie Luo, Barbara Caputo
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 10 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
CVPR
2012
IEEE
13 years 10 months ago
Cross-based local multipoint filtering
This paper presents a cross-based framework of performing local multipoint filtering efficiently. We formulate the filtering process as a local multipoint regression problem, c...
Jiangbo Lu, Keyang Shi, Dongbo Min, Liang Lin, Min...
« Prev « First page 1337 / 1969 Last » Next »