Sciweavers

2107 search results - page 413 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ATAL
2010
Springer
13 years 10 months ago
Closing the learning-planning loop with predictive state representations
A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
Byron Boots, Sajid M. Siddiqi, Geoffrey J. Gordon
COMAD
2009
13 years 10 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey
BMCBI
2010
84views more  BMCBI 2010»
13 years 9 months ago
A variational Bayes algorithm for fast and accurate multiple locus genome-wide association analysis
Background: The success achieved by genome-wide association (GWA) studies in the identification of candidate loci for complex diseases has been accompanied by an inability to expl...
Benjamin A. Logsdon, Gabriel E. Hoffman, Jason G. ...
BMCBI
2010
147views more  BMCBI 2010»
13 years 9 months ago
Learning biological network using mutual information and conditional independence
Background: Biological networks offer us a new way to investigate the interactions among different components and address the biological system as a whole. In this paper, a revers...
Dong-Chul Kim, Xiaoyu Wang, Chin-Rang Yang, Jean G...
BMCBI
2010
104views more  BMCBI 2010»
13 years 9 months ago
Bidirectional best hit r-window gene clusters
Background: Conserved gene clusters are groups of genes that are located close to one another in the genomes of several species. They tend to code for proteins that have a functio...
Melvin Zhang, Hon Wai Leong