67 search results - page 12 / 14 » Approximate convex decomposition of polygons |
125
Voted
ISCAS
2008
IEEE
15 years 6 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
ACIVS
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Extrema of curvature are useful key points for different image analysis tasks. Indeed, polygonal approximation or arc decomposition methods used often these points to ini...
88
Voted
PPL
2006
14 years 11 months ago
2006
A new computational paradigm is described which o ers the possibility of superlinear and sometimes unbounded speedup, when parallel computation is used. The computations involved ...
DCOSS
2007
Springer
15 years 3 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...