Sciweavers

2070 search results - page 25 / 414
» Regret-Minimizing Representative Databases
Sort
View
ISMIR
2005
Springer
123views Music» more  ISMIR 2005»
14 years 3 months ago
Polyphonic Musical Sequence Alignment for Database Search
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...
Bryan Pardo, Manan Sanghi
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 3 months ago
A data-based coding of candidate strings in the closest string problem
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...
Bryant A. Julstrom
EPIA
1993
Springer
14 years 2 months ago
A Uniform Framework for Deductive Database Derivation Strategies
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...
Robert Demolombe
VLDB
1989
ACM
82views Database» more  VLDB 1989»
14 years 2 months ago
Database Support for Hypertext
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...
B. Nick Rossiter
MIS
2001
Springer
151views Multimedia» more  MIS 2001»
14 years 2 months ago
A Data Model for Querying Wavelet Features in Image Databases
Multimedia databases deal with storage and retrieval of complex descriptors of image contents, called features. Traditional techniques consider features as “black boxes,” ofte...
Simone Santini, Amarnath Gupta