Sciweavers

10988 search results - page 1765 / 2198
» Algorithmic Folding Complexity
Sort
View
CVPR
2007
IEEE
16 years 7 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
CVPR
2008
IEEE
16 years 7 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs
CVPR
2008
IEEE
16 years 7 months ago
Smoothing-based Optimization
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...
Marius Leordeanu, Martial Hebert
CVPR
2008
IEEE
16 years 7 months ago
Scene classification with low-dimensional semantic spaces and weak supervision
A novel approach to scene categorization is proposed. Similar to previous works of [11, 15, 3, 12], we introduce an intermediate space, based on a low dimensional semantic "t...
Nikhil Rasiwasia, Nuno Vasconcelos
CVPR
2008
IEEE
16 years 7 months ago
An experimental study of employing visual appearance as a phenotype
Visual and non-visual data are often related through complex, indirect links, thus making the prediction of one from the other difficult. Examples include the partiallyunderstood ...
Lior Wolf, Yoni Donner
« Prev « First page 1765 / 2198 Last » Next »