545 search results - page 70 / 109 » Estimating the Probability of Approximate Matches |
113
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
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....
119
Voted
TCOM
2010
14 years 7 months ago
2010
Abstract--This paper provides a systematic mutual information (MI) and multichannel beamforming (MBF) characterization of optimized multiple-input multiple-output (MIMO) communicat...
119
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
127
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
99
Voted
BMCBI
2010
14 years 10 months ago
2010
Background: Recent studies have revealed the importance of considering the entire distribution of possible secondary structures in RNA secondary structure predictions; therefore, ...