4541 search results - page 893 / 909 » Cache-Oblivious Algorithms and Data Structures |
91
Voted
WWW
2006
ACM
15 years 11 months ago
2006
ACM
On the investigation of linguistic techniques used in ontology matching, we propose a new idea of virtual documents to pursue a cost-effective approach to linguistic matching in t...
CAV
2009
Springer
15 years 11 months ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
185
click to vote
SIGMOD
2009
ACM
15 years 11 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
SIGMOD
2003
ACM
15 years 11 months ago
2003
ACM
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
106
click to vote
SIGMOD
2001
ACM
15 years 11 months ago
2001
ACM
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...