Sciweavers

13500 search results - page 2597 / 2700
» Improved analysis of D
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
15 years 10 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
160
Voted
SIGMOD
2008
ACM
161views Database» more  SIGMOD 2008»
15 years 10 months ago
Efficient pattern matching over event streams
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Ne...
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
15 years 10 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
86
Voted
SIGMOD
2004
ACM
151views Database» more  SIGMOD 2004»
15 years 10 months ago
Highly-Available, Fault-Tolerant, Parallel Dataflows
We present a technique that masks failures in a cluster to provide high availability and fault-tolerance for long-running, parallelized dataflows. We can use these dataflows to im...
Mehul A. Shah, Joseph M. Hellerstein, Eric A. Brew...
PODS
2005
ACM
151views Database» more  PODS 2005»
15 years 10 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...
« Prev « First page 2597 / 2700 Last » Next »