Sciweavers

191 search results - page 21 / 39
» Generalized Power Method for Sparse Principal Component Anal...
Sort
View
APWEB
2005
Springer
15 years 3 months ago
Mining Quantitative Associations in Large Database
Association Rule Mining algorithms operate on a data matrix to derive association rule, discarding the quantities of the items, which contains valuable information. In order to mak...
Chenyong Hu, Yongji Wang, Benyu Zhang, Qiang Yang,...
LICS
1998
IEEE
15 years 1 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
BMCBI
2006
117views more  BMCBI 2006»
14 years 9 months ago
The Cluster Variation Method for Efficient Linkage Analysis on Extended Pedigrees
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...
CVPR
2011
IEEE
14 years 5 months ago
Accelerated Low-Rank Visual Recovery by Random Projection
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
Yadong Mu, Jian Dong, Xiaotong Yuan, Shuicheng Yan
ICMCS
2006
IEEE
101views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Emotional Speech Synthesis using Subspace Constraints in Prosody
An efficient speech synthesis method that uses subspace constraint in prosody is proposed. Conventional unit selection methods concatenate speech segments stored in database, tha...
Shinya Mori, Tsuyoshi Moriyama, Shinji Ozawa