Sciweavers

3311 search results - page 56 / 663
» Modeling Relational Data by the Adjacency Model
Sort
View
IDEAS
1999
IEEE
166views Database» more  IDEAS 1999»
14 years 1 months ago
Recovery Protocols in Multi-Agent Probabilistic Reasoning Systems
In this paper, we introduce a probabilistic relational data model as the basis for developing multi-agent probabilistic reasoning systems. Since our model subsumes the traditional...
Cory J. Butz, S. K. Michael Wong
BIBE
2007
IEEE
124views Bioinformatics» more  BIBE 2007»
14 years 3 months ago
Finding Cancer-Related Gene Combinations Using a Molecular Evolutionary Algorithm
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
Chan-Hoon Park, Soo-Jin Kim, Sun Kim, Dong-Yeon Ch...
NIPS
2008
13 years 10 months ago
Relative Performance Guarantees for Approximate Inference in Latent Dirichlet Allocation
Hierarchical probabilistic modeling of discrete data has emerged as a powerful tool for text analysis. Posterior inference in such models is intractable, and practitioners rely on...
Indraneel Mukherjee, David M. Blei
CSB
2004
IEEE
120views Bioinformatics» more  CSB 2004»
14 years 25 days ago
Dynamic Algorithm for Inferring Qualitative Models of Gene Regulatory Networks
It is still an open problem to identify functional relations with o(N
Zheng Yun, Kwoh Chee Keong
STOC
1990
ACM
108views Algorithms» more  STOC 1990»
14 years 1 months ago
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
Wayne Goddard, Valerie King, Leonard J. Schulman