Sciweavers

3096 search results - page 438 / 620
» The Generalized FITC Approximation
Sort
View
BMCBI
2006
117views more  BMCBI 2006»
15 years 6 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...
JAIR
2008
93views more  JAIR 2008»
15 years 6 months ago
A Rigorously Bayesian Beam Model and an Adaptive Full Scan Model for Range Finders in Dynamic Environments
This paper proposes and experimentally validates a Bayesian network model of a range finder adapted to dynamic environments. All modeling assumptions are rigorously explained, and...
Tinne De Laet, Joris De Schutter, Herman Bruyninck...
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
SIGIR
2008
ACM
15 years 6 months ago
Query dependent ranking using K-nearest neighbor
Many ranking models have been proposed in information retrieval, and recently machine learning techniques have also been applied to ranking model construction. Most of the existin...
Xiubo Geng, Tie-Yan Liu, Tao Qin, Andrew Arnold, H...
TIT
2008
72views more  TIT 2008»
15 years 6 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski