Sciweavers

72 search results - page 10 / 15
» External Memory Algorithms for String Problems
Sort
View
PDCN
2004
13 years 8 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
AAAI
2006
13 years 9 months ago
Domain-Independent Structured Duplicate Detection
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Rong Zhou, Eric A. Hansen
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 7 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
LREC
2008
130views Education» more  LREC 2008»
13 years 9 months ago
Detecting Co-Derivative Documents in Large Text Collections
We have analyzed the SPEX algorithm by Bernstein and Zobel (2004) for detecting co-derivative documents using duplicate n-grams. Although we totally agree with the claim that not ...
Jan Pomikálek, Pavel Rychlý
CODES
2007
IEEE
14 years 1 months ago
Locality optimization in wireless applications
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...
Javed Absar, Min Li, Praveen Raghavan, Andy Lambre...