Finding the best matching database target to a melodic query has been of great interest in the music IR world. The string alignment paradigm works well for this task when comparin...
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
A uniform framework is presented to describe the most typical strategies that are used to compute answers to Deductive Databases. The framework is based on the definition of a ge...
with a full abstract specification of the data-types involved and a multi-level architecture similar to that of a DBMS. A related question is the kind of model that is most suitabl...
Multimedia databases deal with storage and retrieval of complex descriptors of image contents, called features. Traditional techniques consider features as “black boxes,” ofte...