2600 search results - page 206 / 520 » Clustering with or without the Approximation |
161
click to vote
GBRPR
2009
Springer
15 years 11 months ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
187
click to vote
RTCSA
2000
IEEE
15 years 11 months ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
192
click to vote
IS
2008
15 years 6 months ago
2008
We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise c...
117
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Unit selection synthesis inventories have coverage issues, which lead to missing syllable or diphone units. In the conventional back-off strategy of substituting the missing unit ...
186
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...