Sciweavers

628 search results - page 51 / 126
» Distance Field Compression
Sort
View
117
Voted
ICCS
2003
Springer
15 years 6 months ago
A Compress-Based Association Mining Algorithm for Large Dataset
The association mining is one of the primary sub-areas in the field of data mining. This technique had been used in numerous practical applications, including consumer market baske...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
104
Voted
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
15 years 2 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
CIKM
2006
Springer
15 years 4 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
94
Voted
MVA
2002
147views Computer Vision» more  MVA 2002»
15 years 12 days ago
Extraction of Character String Areas from Color Scenery Image Using Extended Psychological Potential Field
As digital cameras have been used widely, a technology to extract features of character string areas from scenery (nature) image is required. However, it is very difficult to extr...
Masanori Anegawa, Akira Nakamura
SIGMETRICS
2010
ACM
212views Hardware» more  SIGMETRICS 2010»
15 years 5 months ago
A mean field model of work stealing in large-scale systems
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
Nicolas Gast, Bruno Gaujal