Sciweavers

5221 search results - page 425 / 1045
» An On-line Problem Database
Sort
View
PR
1998
86views more  PR 1998»
15 years 6 months ago
Optimizing the cost matrix for approximate string matching using genetic algorithms
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
Marc Parizeau, Nadia Ghazzali, Jean-Françoi...
VLSISP
1998
114views more  VLSISP 1998»
15 years 6 months ago
A Region-Based Representation of Images in MARS
We study the problem of representing images within a multimedia Database Management System (DBMS), in order to support fast retrieval operations without compromising storage e cien...
Sergio D. Servetto, Yong Rui, Kannan Ramchandran, ...
TKDE
2002
74views more  TKDE 2002»
15 years 6 months ago
Specifying and Enforcing Association Semantics via ORN in the Presence of Association Cycles
Object Relationship Notation (ORN) is a declarative scheme that allows a variety of common relationship types to be conveniently specified to a Database Management System (DBMS), t...
Bryon K. Ehlmann, Gregory A. Riccardi, Naphtali Ri...
TODS
2002
76views more  TODS 2002»
15 years 6 months ago
Searching for dependencies at multiple abstraction levels
g for Dependencies at Multiple Abstraction Levels Toon Calders Raymond T. Ng Jef Wijsen The notion of roll-up dependency (RUD) extends functional dependencies with generalization ...
Toon Calders, Raymond T. Ng, Jef Wijsen
SIGMOD
2008
ACM
98views Database» more  SIGMOD 2008»
15 years 6 months ago
Scaleability and immortality
James Nicholas Gray's understanding and experimentation gave him a special perspective. From 1995 his commitment was building indefinitely scalable tools by working on really...
Gordon Bell