Sciweavers

3020 search results - page 158 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
16 years 6 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
WAIM
2009
Springer
16 years 1 months ago
Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data
Large amount of uncertain data is inherent in many novel and important applications such as sensor data analysis and mobile data management. A probabilistic threshold range aggrega...
Shuxiang Yang, Wenjie Zhang, Ying Zhang, Xuemin Li...
ICIP
2002
IEEE
15 years 11 months ago
Structure and texture filling-in of missing image blocks in wireless transmission and compression
—An approach for filling-in blocks of missing data in wireless image transmission is presented in this paper. When compression algorithms such as JPEG are used as part of the wir...
Shantanu Rane, Marcelo Bertalmío, Guillermo...
DASFAA
2007
IEEE
202views Database» more  DASFAA 2007»
16 years 28 days ago
Optimizing Moving Queries over Moving Object Data Streams
With the increasing in demand on location-based aware services and RFIDs, efficient processing of continuous queries over moving object streams becomes important. In this paper, w...
Dan Lin, Bin Cui, Dongqing Yang
ISAAC
2004
Springer
121views Algorithms» more  ISAAC 2004»
15 years 12 months ago
Approximate Distance Oracles for Graphs with Dense Clusters
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
Mattias Andersson, Joachim Gudmundsson, Christos L...