4843 search results - page 431 / 969 » The Shortcut Problem - Complexity and Approximation |
125
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
133
click to vote
AAAI
2000
15 years 6 months ago
2000
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given pl...
143
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
134
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
This article proposes a solution of the Lambertian shape from shading (SFS) problem in the case of a pinhole camera model (performing a perspective projection). Our approach is ba...
156
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
A new method for visual tracking of articulated objects is presented. Analyzing articulated motion is challenging because the dimensionality increase potentially demands tremendou...