Sciweavers

1957 search results - page 160 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
CIKM
2010
Springer
14 years 8 months ago
Fast query expansion using approximations of relevance models
Pseudo-relevance feedback (PRF) improves search quality by expanding the query using terms from high-ranking documents from an initial retrieval. Although PRF can often result in ...
Marc-Allen Cartright, James Allan, Victor Lavrenko...
BMCBI
2007
107views more  BMCBI 2007»
14 years 10 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg
CVPR
2005
IEEE
16 years 16 hour ago
Kernel-Based Bayesian Filtering for Object Tracking
Particle filtering provides a general framework for propagating probability density functions in non-linear and non-Gaussian systems. However, the algorithm is based on a Monte Ca...
Bohyung Han, Ying Zhu, Dorin Comaniciu, Larry S. D...
ENC
2005
IEEE
15 years 3 months ago
Saving Evaluations in Differential Evolution for Constrained Optimization
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
Efrén Mezura-Montes, Carlos A. Coello Coell...
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
15 years 10 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons