Sciweavers

4541 search results - page 893 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
WWW
2006
ACM
14 years 8 months ago
Constructing virtual documents for ontology matching
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...
Yuzhong Qu, Wei Hu, Gong Cheng
CAV
2009
Springer
215views Hardware» more  CAV 2009»
14 years 8 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
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...
David Hopkins, C.-H. Luke Ong
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 7 months ago
Quality and efficiency in high dimensional nearest neighbor search
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...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
SIGMOD
2003
ACM
166views Database» more  SIGMOD 2003»
14 years 7 months ago
Statistical Schema Matching across Web Query Interfaces
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang
SIGMOD
2001
ACM
146views Database» more  SIGMOD 2001»
14 years 7 months ago
On Supporting Containment Queries in Relational Database Management Systems
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...
Chun Zhang, Jeffrey F. Naughton, David J. DeWitt, ...