Sciweavers

1023 search results - page 121 / 205
» Graph model selection using maximum likelihood
Sort
View
JAL
2006
101views more  JAL 2006»
13 years 10 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
CIKM
2009
Springer
14 years 4 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ISCI
2008
130views more  ISCI 2008»
13 years 10 months ago
Unified eigen analysis on multivariate Gaussian based estimation of distribution algorithms
Multivariate Gaussian models are widely adopted in continuous Estimation of Distribution Algorithms (EDAs), and covariance matrix plays the essential role in guiding the evolution...
Weishan Dong, Xin Yao
TASLP
2002
124views more  TASLP 2002»
13 years 9 months ago
A robust compensation strategy for extraneous acoustic variations in spontaneous speech recognition
In this paper, we propose a robust compensation strategy to deal effectively with extraneous acoustic variations for spontaneous speech recognition. This strategy extends speaker a...
Hui Jiang, Li Deng
MICRO
2002
IEEE
164views Hardware» more  MICRO 2002»
14 years 2 months ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
Amir Roth, Gurindar S. Sohi