Sciweavers

2354 search results - page 357 / 471
» Randomness, Stochasticity and Approximations
Sort
View
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
16 years 6 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...
VLSID
2006
IEEE
240views VLSI» more  VLSID 2006»
16 years 6 months ago
An Efficient and Accurate Logarithmic Multiplier Based on Operand Decomposition
Logarithmic Number Systems (LNS) offer a viable alternative in terms of area, delay and power to binary number systems for multiplication and division operations in signal process...
Venkataraman Mahalingam, N. Ranganathan
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
16 years 6 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
SIGMOD
2005
ACM
220views Database» more  SIGMOD 2005»
16 years 6 months ago
Sampling Algorithms in a Stream Operator
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
Theodore Johnson, S. Muthukrishnan, Irina Rozenbau...
SDM
2009
SIAM
331views Data Mining» more  SDM 2009»
16 years 3 months ago
Privacy Preservation in Social Networks with Sensitive Edge Weights.
With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...
Jie Wang, Jinze Liu, Jun Zhang, Lian Liu