Sciweavers

960 search results - page 69 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 4 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
264
Voted
ICDE
2009
IEEE
202views Database» more  ICDE 2009»
16 years 5 months ago
Tracking High Quality Clusters over Uncertain Data Streams
Recently, data mining over uncertain data streams has attracted a lot of attentions because of the widely existed imprecise data generated from a variety of streaming applications....
Chen Zhang, Ming Gao, Aoying Zhou
ACIIDS
2012
IEEE
307views Database» more  ACIIDS 2012»
13 years 11 months ago
A Hybrid Evolutionary Imperialist Competitive Algorithm (HEICA)
This paper proposes a new approach by combining the Evolutionary Algorithm and Imperialist Competitive Algorithm. This approach tries to capture several people involved in communit...
Fatemeh Ramezani, Shahriar Lotfi, M. A. Soltani-Sa...
142
Voted
TASLP
2010
106views more  TASLP 2010»
14 years 10 months ago
Efficient and Robust Music Identification With Weighted Finite-State Transducers
We present an approach to music identification based on weighted finite-state transducers and Gaussian mixture models, inspired by techniques used in large-vocabulary speech recogn...
Mehryar Mohri, Pedro Moreno, Eugene Weinstein
BMCBI
2006
129views more  BMCBI 2006»
15 years 4 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...