138 search results - page 4 / 28 » Hardness of fully dense problems |
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
IJSM
2007
13 years 7 months ago
2007
We present an approach to find dense point-to-point correspondences between two deformed surfaces corresponding to different postures of the same nonrigid object in a fully autom...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Fully automatic 3D modeling from a catadioptric image sequence has rarely been addressed until now, although this is a long-standing problem for perspective images. All previous c...