Sciweavers

2853 search results - page 68 / 571
» On the Efficiency of Provenance Queries
Sort
View
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
15 years 1 months ago
An Efficient Index Lattice for XML Query Evaluation
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
Wilfred Ng, James Cheng
CCCG
2008
14 years 11 months ago
An Efficient Query Structure for Mesh Refinement
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
Benoît Hudson, Duru Türkoglu
COCOON
1998
Springer
15 years 2 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
ALT
1997
Springer
15 years 1 months ago
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
Thomas Erlebach, Peter Rossmanith, Hans Stadtherr,...
ICASSP
2008
IEEE
15 years 4 months ago
Fast query by example of environmental sounds via robust and efficient cluster-based indexing
There has been much recent progress in the technical infrastructure necessary to continuously characterize and archive all sounds, or more precisely auditory streams, that occur w...
Jiachen Xue, Gordon Wichern, Harvey D. Thornburg, ...