Sciweavers

253 search results - page 17 / 51
» Fast algorithms for time series mining
Sort
View
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
16 years 17 days 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...
KES
2008
Springer
14 years 11 months ago
Fast Cryptographic Privacy Preserving Association Rules Mining on Distributed Homogenous Data Base
Privacy is one of the most important properties of an information system must satisfy. In which systems the need to share information among different, not trusted entities, the pro...
Mahmoud Hussein, Ashraf El-Sisi, Nabil A. Ismail
88
Voted
CORR
2006
Springer
114views Education» more  CORR 2006»
15 years 14 days ago
Fast algorithms for computing isogenies between elliptic curves
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
Alin Bostan, Bruno Salvy, François Morain, ...
97
Voted
ICPR
2008
IEEE
15 years 6 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov
DKE
2006
125views more  DKE 2006»
15 years 13 days ago
Online clustering of parallel data streams
In recent years, the management and processing of so-called data streams has become a topic of active research in several fields of computer science such as, e.g., distributed sys...
Jürgen Beringer, Eyke Hüllermeier