Sciweavers

137 search results - page 13 / 28
» On probabilistic analysis of randomization in hybrid symboli...
Sort
View
RECOMB
2000
Springer
13 years 11 months ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal
CIKM
2008
Springer
13 years 9 months ago
On low dimensional random projections and similarity search
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...
Yu-En Lu, Pietro Liò, Steven Hand
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
14 years 1 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
SIGIR
2004
ACM
14 years 1 months ago
GaP: a factor model for discrete data
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
John F. Canny
ACCV
2006
Springer
14 years 1 months ago
Probabilistic Modeling for Structural Change Inference
We view the task of change detection as a problem of object recognition from learning. The object is defined in a 3D space where the time is the 3rd dimension. We propose two com...
Wei Liu, Véronique Prinet