Sciweavers

389 search results - page 8 / 78
» A skip-list approach for efficiently processing forecasting ...
Sort
View
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
14 years 7 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...
ICDE
2006
IEEE
191views Database» more  ICDE 2006»
14 years 8 months ago
Query Decomposition: A Multiple Neighborhood Approach to Relevance Feedback Processing in Content-based Image Retrieval
Today's Content-Based Image Retrieval (CBIR) techniques are based on the "k-nearest neighbors" (kNN) model. They retrieve images from a single neighborhood using lo...
Kien A. Hua, Ning Yu, Danzhou Liu
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
14 years 9 months ago
On Efficient Query Processing of Stream Counts on the Cell Processor
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal,...
MDM
2010
Springer
281views Communications» more  MDM 2010»
13 years 9 months ago
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
Jie Bao 0003, Chi-Yin Chow, Mohamed F. Mokbel, Wei...
ESWS
2009
Springer
13 years 5 months ago
Applied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
Jonas Tappolet, Abraham Bernstein