Sciweavers

21 search results - page 2 / 5
» Average Case Analyses of List Update Algorithms, with Applic...
Sort
View
AUSAI
2007
Springer
13 years 11 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
JMIV
2006
176views more  JMIV 2006»
13 years 5 months ago
Centroidal Voronoi Tessellation Algorithms for Image Compression, Segmentation, and Multichannel Restoration
Centroidal Voronoi tessellations (CVT's) are special Voronoi tessellations for which the generators of the tessellation are also the centers of mass (or means) of the Voronoi ...
Qiang Du, Max Gunzburger, Lili Ju, Xiaoqiang Wang
PC
2007
161views Management» more  PC 2007»
13 years 4 months ago
High performance combinatorial algorithm design on the Cell Broadband Engine processor
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
David A. Bader, Virat Agarwal, Kamesh Madduri, Seu...
CASES
2006
ACM
13 years 11 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
14 years 5 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...