Sciweavers

609 search results - page 58 / 122
» Linear-Time Computation of Similarity Measures for Sequentia...
Sort
View
CIKM
2006
Springer
14 years 11 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
DBA
2006
236views Database» more  DBA 2006»
14 years 11 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
15 years 10 months ago
Locality sensitive hash functions based on concomitant rank order statistics
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
Kave Eshghi, Shyamsundar Rajaram
ICASSP
2011
IEEE
14 years 1 months ago
Online anomaly detection with expert system feedback in social networks
In this paper, we propose examining the participants in various meetings or communications within a social network, and using sequential inference based on these participant lists...
Corinne Horn, Rebecca Willett
IPPS
2007
IEEE
15 years 4 months ago
From Hardware to Software Synthesis of Linear Feedback Shift Registers
Linear Feedback Shift Registers (LFSRs) have always received considerable attention in computer science especially in coding theory and in cryptography. The scope of applications ...
Cédric Lauradoux