Sciweavers

1445 search results - page 159 / 289
» XPath query containment
Sort
View
JGTOOLS
2008
100views more  JGTOOLS 2008»
14 years 10 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
IJCGA
2000
85views more  IJCGA 2000»
14 years 10 months ago
Obnoxious Facility Location: Complete Service with Minimal Harm
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
103
Voted
IR
2000
14 years 10 months ago
New Approaches to Spoken Document Retrieval
This paper presents four novel techniques for open-vocabulary spoken document retrieval: a method to detect slots that possibly contain a query feature; a method to estimate occurr...
Martin Wechsler, Eugen Munteanu, Peter Schäub...
IJFCS
2002
122views more  IJFCS 2002»
14 years 9 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
PVLDB
2010
112views more  PVLDB 2010»
14 years 8 months ago
Towards The Web of Concepts: Extracting Concepts from Large Datasets
Concepts are sequences of words that represent real or imaginary entities or ideas that users are interested in. As a first step towards building a web of concepts that will form...
Aditya G. Parameswaran, Hector Garcia-Molina, Anan...