Sciweavers

656 search results - page 43 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
95
Voted
WWW
2008
ACM
15 years 10 months ago
Efficient mining of frequent sequence generators
Sequential pattern mining has raised great interest in data mining research field in recent years. However, to our best knowledge, no existing work studies the problem of frequent...
Chuancong Gao, Jianyong Wang, Yukai He, Lizhu Zhou
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
15 years 10 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
ISCAS
2005
IEEE
123views Hardware» more  ISCAS 2005»
15 years 3 months ago
Lower-bound estimation for multi-bitwidth scheduling
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
Junjuan Xu, Jason Cong, Xu Cheng
83
Voted
CEC
2009
IEEE
15 years 2 months ago
Parallel BMDA with an aggregation of probability models
—The paper is focused on the problem of aggregation of probability distribution applicable for parallel Bivariate Marginal Distribution Algorithm (pBMDA). A new approach based on...
Jirí Jaros, Josef Schwarz
PVM
1999
Springer
15 years 1 months ago
Parallel Computation of the SVD of a Matrix Product
In this paper we study a parallel algorithm for computing the singular value decomposition (SVD) of a product of two matrices on message passing multiprocessors. This algorithm is ...
José M. Claver, Manuel Mollar, Vicente Hern...