417 search results - page 82 / 84 » Convex Shape Decomposition |
COLT
1999
Springer
13 years 11 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
SIGGRAPH
1995
ACM
13 years 11 months ago
1995
ACM
We present an efficient and uniform approach for the automatic reconstruction of surfaces of CAD (computer aided design) models and scalar fields defined on them, from an unorg...
PAMI
2006
13 years 7 months ago
2006
In this paper, we propose two novel methods for face recognition under arbitrary unknown lighting by using spherical harmonics illumination representation, which require only one t...
CN
2004
13 years 7 months ago
2004
Congestion-based pricing of network resources is a common approach in evolving network architectures that support Quality of Service (QoS). Resource usage and QoS will thus fluctu...
ALGORITHMICA
1998
13 years 7 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...