Sciweavers

43 search results - page 7 / 9
» Fast and Accurate Probe Selection Algorithm for Large Genome...
Sort
View
BMCBI
2008
111views more  BMCBI 2008»
13 years 8 months ago
Probabilistic base calling of Solexa sequencing data
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
Jacques Rougemont, Arnaud Amzallag, Christian Isel...
CVIU
2011
13 years 3 days ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
CVPR
2009
IEEE
15 years 3 months ago
Learning query-dependent prefilters for scalable image retrieval
We describe an algorithm for similar-image search which is designed to be efficient for extremely large collections of images. For each query, a small response set is selected by...
Lorenzo Torresani (Dartmouth College), Martin Szum...
ICML
2004
IEEE
14 years 9 months ago
Predictive automatic relevance determination by expectation propagation
In many real-world classification problems the input contains a large number of potentially irrelevant features. This paper proposes a new Bayesian framework for determining the r...
Yuan (Alan) Qi, Thomas P. Minka, Rosalind W. Picar...
PODS
1999
ACM
121views Database» more  PODS 1999»
14 years 27 days ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...