74 search results - page 15 / 15 » Improved Approximate String Matching Using Compressed Suffix... |
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
CCECE
2006
IEEE
13 years 11 months ago
2006
IEEE
During recent years there has been an explosive growth of biological data coming from genome projects, proteomics, protein structure determination, and the rapid expansion in digi...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
SIAMCOMP
2011
13 years 9 days ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...