33 search results - page 6 / 7 » The Complexity of Counting Problems in Equational Matching |
140
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. We present a closed-form solution to the problem of recovering the 3D shape of a non-rigid inelastic surface from 3D-to-2D correspondences. This lets us detect and recons...
151
click to vote
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
232
click to vote
PODS
2011
ACM
14 years 7 months ago
2011
ACM
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
144
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents a modified optimal control model of drug scheduling in cancer chemotherapy and a new adaptive elitist-population based genetic algorithm (AEGA) to solve it. Wo...
137
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Gradient-domain compositing is an essential tool in computer vision and its applications, e.g., seamless cloning, panorama stitching, shadow removal, scene completion and...