Sciweavers

2034 search results - page 58 / 407
» Substring Selectivity Estimation
Sort
View
ICCV
2009
IEEE
14 years 7 months ago
Exploiting uncertainty in random sample consensus
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys
ISM
2008
IEEE
83views Multimedia» more  ISM 2008»
15 years 4 months ago
Fast and Flexible Tree Rendering with Enhanced Visibility Estimation
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budg...
Jessy Lee, C. C. Jay Kuo
AAAI
1997
14 years 11 months ago
Case-Based Similarity Assessment: Estimating Adaptability from Experience
Case-based problem-solving systems rely on similarity assessment to select stored cases whose solutions are easily adaptable to t current problems. However, widely-used similarity...
David B. Leake, Andrew Kinley, David C. Wilson
RECOMB
2001
Springer
15 years 10 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa
BMCBI
2008
128views more  BMCBI 2008»
14 years 10 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich