157 search results - page 15 / 32 » On indexing error-tolerant set containment |
NGITS
1997
Springer
15 years 1 months ago
1997
Springer
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
177
Voted
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
ICDAR
2003
IEEE
15 years 2 months ago
2003
IEEE
For the transition from traditional to digital libraries, the large number of handwritten manuscripts that exist pose a great challenge. Easy access to such collections requires a...
DBPL
1993
Springer
15 years 1 months ago
1993
Springer
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments , an object-oriented data model at the core of a scient...
DAM
2010
14 years 9 months ago
2010
Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...