Sciweavers

3368 search results - page 316 / 674
» The Complexity of Query Reliability
Sort
View
IJFCS
2002
122views more  IJFCS 2002»
15 years 6 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
IPL
2010
71views more  IPL 2010»
15 years 5 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
PVLDB
2010
97views more  PVLDB 2010»
15 years 5 months ago
TRAMP: Understanding the Behavior of Schema Mappings through Provenance
Though partially automated, developing schema mappings remains a complex and potentially error-prone task. In this paper, we present TRAMP (TRAnsformation Mapping Provenance), an ...
Boris Glavic, Gustavo Alonso, Renée J. Mill...
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 4 months ago
XSB: Extending Prolog with Tabled Logic Programming
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
Terrance Swift, David Scott Warren
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
16 years 7 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...