Sciweavers

3020 search results - page 275 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
16 years 7 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 8 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
COLING
2010
15 years 1 months ago
Discriminative Induction of Sub-Tree Alignment using Limited Labeled Data
We employ Maximum Entropy model to conduct sub-tree alignment between bilingual phrasal structure trees. Various lexical and structural knowledge is explored to measure the syntac...
Jun Sun, Min Zhang, Chew Lim Tan
ICWS
2009
IEEE
16 years 3 months ago
RDF Data-Centric Storage
—The vision of the Semantic Web has brought about new challenges at the intersection of web research and data management. One fundamental research issue at this intersection is t...
Justin J. Levandoski, Mohamed F. Mokbel
COMPGEOM
2005
ACM
15 years 8 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg