Sciweavers

1523 search results - page 218 / 305
» The Computational Complexity of Linear Optics
Sort
View
ICCV
2009
IEEE
15 years 2 months ago
Heterogeneous Feature Machines for Visual Recognition
With the recent efforts made by computer vision researchers, more and more types of features have been designed to describe various aspects of visual characteristics. Modeling s...
Liangliang Cao, Jiebo Luo, Feng Liang, Thomas S. H...
CVPR
2001
IEEE
14 years 11 months ago
Semi-Dense Stereo Correspondence with Dense Features
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler
ECCV
2006
Springer
14 years 11 months ago
Optimal Multi-frame Correspondence with Assignment Tensors
Abstract. Establishing correspondence between features of a set of images has been a long-standing issue amongst the computer vision community. We propose a method that solves the ...
R. Oliveira, R. Ferreira, J. P. Costeira
CP
2009
Springer
14 years 10 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
PODC
2009
ACM
14 years 10 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young