Sciweavers

1787 search results - page 47 / 358
» Approximation Techniques for Spatial Data
Sort
View
TMI
1998
175views more  TMI 1998»
13 years 8 months ago
A Harmonic Decomposition Reconstruction Algorithm for Spatially-Varying Focal Length Collimators
—Spatially varying focal length fan-beam collimators can be used in single photon emission computed tomography to improve detection efficiency and to reduce reconstruction artif...
Jiangsheng You, Zhengrong Liang, Shanglian Bao
TKDE
2002
127views more  TKDE 2002»
13 years 8 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
COMPGEOM
2004
ACM
14 years 2 months ago
Deterministic sampling and range counting in geometric data streams
We present memory-efficient deterministic algorithms for constructing -nets and -approximations of streams of geometric data. Unlike probabilistic approaches, these deterministic...
Amitabha Bagchi, Amitabh Chaudhary, David Eppstein...
ICDE
2012
IEEE
257views Database» more  ICDE 2012»
11 years 11 months ago
LARS: A Location-Aware Recommender System
Abstract—This paper proposes LARS, a location-aware recommender system that uses location-based ratings to produce recommendations. Traditional recommender systems do not conside...
Justin J. Levandoski, Mohamed Sarwat, Ahmed Eldawy...
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
13 years 10 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari