563 search results - page 68 / 113 » Computing approximate PSD factorizations |
148
click to vote
FOCS
2008
IEEE
16 years 14 days ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
172
click to vote
AINA
2007
IEEE
16 years 11 days ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
150
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
178
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
This paper presents a novel solution for flow-based tracking and 3D reconstruction of deforming objects in monocular image sequences. A non-rigid 3D object undergoing rotation and...
170
click to vote
ICIP
1999
IEEE
16 years 7 months ago
1999
IEEE
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...