11051 search results - page 2115 / 2211 » An Investigation of Generalized Cases |
CPM
1998
Springer
14 years 2 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
FODO
1998
Springer
14 years 2 months ago
1998
Springer
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
LATIN
1998
Springer
14 years 2 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
VLDB
1998
ACM
14 years 2 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
ANZIIS
1996
IEEE
14 years 2 months ago
1996
IEEE
This paper describes the design and developmentof an expert system for tourist information center. The expert system was built to recommend a suitable travel schedule that satisfi...