Sciweavers

56 search results - page 11 / 12
» Practical Compressed Suffix Trees
Sort
View
127
Voted
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
15 years 5 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
167
Voted
CL
2000
Springer
15 years 3 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
139
Voted
IJIT
2004
15 years 5 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
152
Voted
WWW
2010
ACM
15 years 10 months ago
A pattern tree-based approach to learning URL normalization rules
Duplicate URLs have brought serious troubles to the whole pipeline of a search engine, from crawling, indexing, to result serving. URL normalization is to transform duplicate URLs...
Tao Lei, Rui Cai, Jiang-Ming Yang, Yan Ke, Xiaodon...
108
Voted
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
15 years 10 months ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender