1604 search results - page 173 / 321 » Approximation algorithms for developable surfaces |
123
click to vote
SBCCI
2003
ACM
15 years 7 months ago
2003
ACM
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...
128
click to vote
ESA
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
115
click to vote
CGF
2008
15 years 1 months ago
2008
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long-standing challenge. P...
RECSYS
2009
ACM
15 years 8 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
109
click to vote
ISSAC
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...