2693 search results - page 223 / 539 » On Computing Complex Navigation Functions |
176
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Most algorithms for 3D reconstruction from images use cost functions based on SSD, which assume that the surfaces being reconstructed are visible to all cameras. This makes it dif...
153
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
162
click to vote
ISTCS
1995
Springer
15 years 10 months ago
1995
Springer
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
129
click to vote
APAL
2008
15 years 6 months ago
2008
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...
164
click to vote
SIAMJO
2000
15 years 6 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...