1604 search results - page 111 / 321 » Approximation algorithms for developable surfaces |
130
click to vote
IRREGULAR
1995
Springer
15 years 5 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
109
click to vote
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
Most of the shape from shading (SFS) algorithms have been developed under the simplifying assumptions of a Lambertian surface, an orthographic projection, and a distant light sour...
121
click to vote
BMCBI
2004
15 years 1 months ago
2004
Background: Accessible surface area (ASA) or solvent accessibility of amino acids in a protein has important implications. Knowledge of surface residues helps in locating potentia...
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
119
click to vote
SMI
2005
IEEE
15 years 7 months ago
2005
IEEE
Traditional approaches for modeling a closed manifold surface with either regular tensor-product or triangular splines (defined over an open planar domain) require decomposing th...