Sciweavers

611 search results - page 42 / 123
» Querying Tree-Structured Data Using Dimension Graphs
Sort
View
PODS
1997
ACM
182views Database» more  PODS 1997»
13 years 12 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
GEOS
2007
Springer
14 years 1 months ago
Supporting Complex Thematic, Spatial and Temporal Queries over Semantic Web Data
Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. Often, t...
Matthew Perry, Amit P. Sheth, Farshad Hakimpour, P...
ICDE
2012
IEEE
202views Database» more  ICDE 2012»
11 years 10 months ago
Differentially Private Spatial Decompositions
— Differential privacy has recently emerged as the de facto standard for private data release. This makes it possible to provide strong theoretical guarantees on the privacy and ...
Graham Cormode, Cecilia M. Procopiuc, Divesh Sriva...
PLDI
2004
ACM
14 years 1 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
TKDE
2012
207views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Mining Web Graphs for Recommendations
—As the exponential explosion of various contents generated on the Web, Recommendation techniques have become increasingly indispensable. Innumerable different kinds of recommend...
Hao Ma, Irwin King, Michael R. Lyu