450 search results - page 2 / 90 » A Geometric Approach to the Problem of Unique Decomposition ... |
ICASSP
2011
IEEE
13 years 7 days ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
BPM
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
JDCTA
2010
13 years 3 months ago
2010
Because the characteristic of wavelet transform is multi-resolution, their unique advantage of the data model is multi-scale analysis. Then, it's widely used the Wavelet-base...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
While spectral clustering has been applied successfully to problems in computer vision, their applicability is limited to pairwise similarity measures that form a probability matr...
TSMC
2008
13 years 8 months ago
2008
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...