34 search results - page 2 / 7 » A memory for goals model of sequence errors |
DASFAA
2003
IEEE
13 years 10 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
CORR
2011
Springer
13 years 15 days ago
2011
Springer
—We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook C consisting of strings of n bits, and our model of t...
ICIP
2005
IEEE
14 years 7 months ago
2005
IEEE
We reconstruct geometry for a time-varying scene given by a number of video sequences. The dynamic geometry is represented by a 3D hypersurface embedded in space-time. The interse...
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper addresses the problem of discriminative training of language models that does not require any transcribed acoustic data. We propose to minimize the conditional entropy ...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— Given an AWGN channel, we look at the problem of designing a source controlled binary antipodal signaling system for transmitting blocks of binary symbols generated either by a...