122 search results - page 24 / 25 » The approximability of the String Barcoding problem |
ISMIR
2005
Springer
13 years 11 months ago
2005
Springer
This paper addresses the problem of identifying musical instruments in polyphonic music. Musical instrument identification (MII) is an improtant task in music information retriev...
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
RECOMB
2004
Springer
14 years 5 months ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
PODS
2009
ACM
14 years 6 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...