417 search results - page 12 / 84 » Convex Shape Decomposition |
125
click to vote
JCO
2006
15 years 5 months ago
2006
Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned ni numbers with ni lying in a given range. The goal is to maximize a Schur con...
187
click to vote
ISVC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
144
Voted
COMPGEOM
1999
ACM
15 years 9 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
156
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper we are interested in non-negative matrix factorization (NMF) with the Itakura-Saito (IS) divergence. Previous work has demonstrated the relevance of this cost functi...
158
Voted
COLT
2005
Springer
15 years 10 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...