Sciweavers

4926 search results - page 652 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
BMCBI
2007
160views more  BMCBI 2007»
13 years 8 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
SIGIR
2009
ACM
14 years 3 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
ECAI
2004
Springer
14 years 1 months ago
Adversarial Constraint Satisfaction by Game-Tree Search
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
Kenneth N. Brown, James Little, Páidí...
SPIRE
2010
Springer
13 years 6 months ago
Identifying SNPs without a Reference Genome by Comparing Raw Reads
Next generation sequencing (NGS) technologies are being applied to many fields of biology, notably to survey the polymorphism across individuals of a species. However, while single...
Pierre Peterlongo, Nicolas Schnel, Nadia Pisanti, ...
PAMI
2008
161views more  PAMI 2008»
13 years 8 months ago
TRUST-TECH-Based Expectation Maximization for Learning Finite Mixture Models
The Expectation Maximization (EM) algorithm is widely used for learning finite mixture models despite its greedy nature. Most popular model-based clustering techniques might yield...
Chandan K. Reddy, Hsiao-Dong Chiang, Bala Rajaratn...