777 search results - page 141 / 156 » A fast algorithm for the computation of an upper bound on th... |
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
ALGORITHMICA
2005
13 years 8 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
Todays abundance of storage coupled with digital technologies in virtually any scientific or commercial application such as medical and biological imaging or music archives deal w...
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Haplotyping via perfect phylogeny is a method for retrieving haplotypes from genotypes. Fast algorithms are known for computing perfect phylogenies from complete and erro...