905 search results - page 112 / 181 » On the Complexity of uSPR Distance |
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
121
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
In recent years, 3D deformable surface reconstruction
from single images has attracted renewed interest. It has
been shown that preventing the surface from either shrinking
or s...
120
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
Establishing visual correspondences is an essential component
of many computer vision problems, and is often done
with robust, local feature-descriptors. Transmission and
storag...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
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...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Fast retrieval methods are critical for large-scale and
data-driven vision applications. Recent work has explored
ways to embed high-dimensional features or complex distance
fun...