Sciweavers

354 search results - page 26 / 71
» Efficient Processing of Spatial Joins Using R-Trees
Sort
View
ICIP
2010
IEEE
13 years 6 months ago
Multiview image compression using a layer-based representation
We propose a novel compression method for multiview still images. The algorithm exploits the layer-based representation, which partitions the data set into planar layers character...
Andriy Gelman, Pier Luigi Dragotti, Vladan Velisav...
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
14 years 8 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias
ICDCS
2007
IEEE
14 years 2 months ago
Stabilizing Peer-to-Peer Spatial Filters
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
Silvia Bianchi, Ajoy Kumar Datta, Pascal Felber, M...
JMLR
2008
159views more  JMLR 2008»
13 years 8 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
BTW
1999
Springer
157views Database» more  BTW 1999»
14 years 23 days ago
Database Primitives for Spatial Data Mining
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
Martin Ester, Stefan Grundlach, Hans-Peter Kriegel...