Sciweavers

1640 search results - page 173 / 328
» Conditional Independence Trees
Sort
View
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 4 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
JMLR
2012
11 years 11 months ago
Bayesian regularization of non-homogeneous dynamic Bayesian networks by globally coupling interaction parameters
To relax the homogeneity assumption of classical dynamic Bayesian networks (DBNs), various recent studies have combined DBNs with multiple changepoint processes. The underlying as...
Marco Grzegorczyk, Dirk Husmeier
IJNSEC
2008
124views more  IJNSEC 2008»
13 years 9 months ago
Scalable Delay-constrained Multicast Group Key Management
In the last few years, multicasting is increasingly used as an efficient communication mechanism for group-oriented applications in the Internet. Some multicast applications requi...
Said Gharout, Yacine Challal, Abdelmadjid Bouabdal...
CLEAR
2007
Springer
166views Biometrics» more  CLEAR 2007»
14 years 3 months ago
The IBM Rich Transcription 2007 Speech-to-Text Systems for Lecture Meetings
The paper describes the IBM systems submitted to the NIST Rich Transcription 2007 (RT07) evaluation campaign for the speechto-text (STT) and speaker-attributed speech-to-text (SAST...
Jing Huang, Etienne Marcheret, Karthik Visweswaria...
RCIS
2010
13 years 7 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu