SPIRE
2001
Springer
14 years 4 months ago
2001
Springer
The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a st...
SPIRE
2001
Springer
14 years 4 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
SPIRE
2001
Springer
14 years 4 months ago
2001
Springer
Most queries to text search engines are ranked or Boolean. Phrase querying is a powerful technique for refining searches, but is expensive to implement on conventional indexes. I...
SPIRE
2001
Springer
14 years 4 months ago
2001
Springer
SPIRE
2001
Springer
14 years 4 months ago
2001
Springer
In this paper, we study query processing in a distributed text database. The novelty is a real distributed architecture implementation that offers concurrent query service. The di...
SPIRE
2001
Springer
14 years 4 months ago
2001
Springer
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
OOIS
2001
Springer
14 years 4 months ago
2001
Springer
Ontology is a comprehensive knowledge model which enables the developer to practice a “higher” level of reuse of knowledge. Typically, different modeling languages are employe...
OOIS
2001
Springer
14 years 4 months ago
2001
Springer
OOIS
2001
Springer
14 years 4 months ago
2001
Springer
: This paper presents Reconciliation+, a tool-supported method which identifies overlaps between models of different object interactions expressed as UML sequence and/or collaborat...
OOIS
2001
Springer
14 years 4 months ago
2001
Springer
We propose a designing method of Web application based on the new standard XML and on the dataweb notion. The content of the dataweb is obtained by an integration technique of het...