Sciweavers

3360 search results - page 172 / 672
» Opportunistic Data Structures with Applications
Sort
View
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
16 years 4 months ago
Approximately detecting duplicates for streaming data using stable bloom filters
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
Fan Deng, Davood Rafiei
MOBISYS
2009
ACM
16 years 4 months ago
A methodology for extracting temporal properties from sensor network data streams
The extraction of temporal characteristics from sensor data streams can reveal important properties about the sensed events. Knowledge of temporal characteristics in applications ...
Dimitrios Lymberopoulos, Athanasios Bamis, Andreas...
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
16 years 5 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
16 years 4 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
VLDB
2007
ACM
229views Database» more  VLDB 2007»
15 years 10 months ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...