1604 search results - page 203 / 321 » Approximation algorithms for developable surfaces |
129
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: G- Protein coupled receptors (GPCRs) comprise the largest group of eukaryotic cell surface receptors with great pharmacological interest. A broad range of native ligan...
100
click to vote
CAE
2010
14 years 8 months ago
2010
Renaissance artists discovered methods for imaging realistic depth on a two dimensional surface by re-inventing linear perspective. In solving the problem of depth depiction, they...
115
click to vote
WWW
2005
ACM
16 years 2 months ago
2005
ACM
Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We stu...
103
click to vote
PKDD
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
117
click to vote
ESA
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...