804 search results - page 89 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
AIRS
2006
Springer
13 years 11 months ago
2006
Springer
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
SBBD
2007
13 years 9 months ago
2007
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, we propose a novel method for rapid feature space Maximum Likelihood Linear Regression (FMLLR) speaker adaptation based on bilinear models. When the amount of adapt...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
1 A kernel determines the inductive bias of a learning algorithm on a specific data set, and it is beneficial to design specific kernel for a given data set. In this work, we propo...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...