Sciweavers

1806 search results - page 266 / 362
» Randomness and halting probabilities
Sort
View
139
Voted
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
16 years 4 months ago
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
Bill Yuan-chi Chiu, Eamonn J. Keogh, Stefano Lonar...
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
16 years 4 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
16 years 4 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
16 years 4 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...
PODS
2006
ACM
96views Database» more  PODS 2006»
16 years 4 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...