Sciweavers

1888 search results - page 41 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
COMAD
2008
14 years 11 months ago
Querying for Information Integration: How to go from an Imprecise Intent to a Precise Query?
In this paper, we address the problem of query formulation in the context of multi-domain integration of heterogeneous data on the Web. We argue that effectively tackling this pro...
Aditya Telang, Sharma Chakravarthy, Chengkai Li
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
15 years 10 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
87
Voted
IPPS
1997
IEEE
15 years 2 months ago
Maintaining Spatial Data Sets in Distributed-Memory Machines
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
Susanne E. Hambrusch, Ashfaq A. Khokhar
79
Voted
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 1 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
111
Voted
TIP
2011
123views more  TIP 2011»
14 years 5 months ago
Spatial Sparsity-Induced Prediction (SIP) for Images and Video: A Simple Way to Reject Structured Interference
We propose a prediction technique that is geared toward forming successful estimates of a signal based on a correlated anchor signal that is contaminated with complex interference...
Gang Hua, Onur G. Guleryuz