Sciweavers

309 search results - page 32 / 62
» Partial Move A*
Sort
View
ISNN
2005
Springer
14 years 27 days ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
13 years 11 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
PODS
1995
ACM
139views Database» more  PODS 1995»
13 years 11 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
ICCV
2009
IEEE
15 years 11 days ago
A linear formulation of shape from specular flow
When a curved mirror-like surface moves relative to its environment, it induces a motion field—or specular flow— on the image plane that observes it. This specular flow is r...
Guillermo D. Canas, Yuriy Vasilyev, Yair Adato, To...
20
Voted
ICIP
2004
IEEE
14 years 9 months ago
Model-based MPEG compression of synthetic video sequences
The paper addresses the problem of improving the MPEG compression of synthetic video sequences by exploiting the knowledge about the original 3D model. Two techniques are proposed...
Davide Quaglia, Angelo Gattuso