Sciweavers

192 search results - page 28 / 39
» Analyzing Range Queries on Spatial Data
Sort
View
SIGMOD
2008
ACM
198views Database» more  SIGMOD 2008»
14 years 7 months ago
Efficient storage scheme and query processing for supply chain management using RFID
As the size of an RFID tag becomes smaller and the price of the tag gets lower, RFID technology has been applied to a wide range of areas. Recently, RFID has been adopted in the b...
Chun-Hee Lee, Chin-Wan Chung
DCG
2010
289views more  DCG 2010»
13 years 7 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
13 years 11 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....
WIDM
2006
ACM
14 years 1 months ago
The GEON portal: accelerating knowledge discovery in the geosciences
Geoscience studies produce data from various observations, experiments, and simulations at an enormous rate. With proliferation of applications and data formats, the geoscience re...
Ullas Nambiar, Bertram Ludäscher, Kai Lin, Ch...
CIKM
2011
Springer
12 years 7 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...