Sciweavers

2609 search results - page 417 / 522
» Optimizing for parallelism and data locality
Sort
View
116
Voted
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 1 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
DATE
2007
IEEE
150views Hardware» more  DATE 2007»
15 years 7 months ago
Fast memory footprint estimation based on maximal dependency vector calculation
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
Qubo Hu, Arnout Vandecappelle, Per Gunnar Kjeldsbe...
87
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
Rate Adaptation for Cooperative Systems
— Throughput is an important performance measure for data communications over wireless links. In this work, we consider joint adaptation of coding rates, modulation modes and lev...
Zinan Lin, Elza Erkip, Monisha Ghosh
108
Voted
DATE
2003
IEEE
97views Hardware» more  DATE 2003»
15 years 6 months ago
Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation
Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an op...
G. Surendra, Subhasis Banerjee, S. K. Nandy
FCCM
2009
IEEE
115views VLSI» more  FCCM 2009»
15 years 4 months ago
Multi-Core Architecture on FPGA for Large Dictionary String Matching
FPGA has long been considered an attractive platform for high performance implementations of string matching. However, as the size of pattern dictionaries continues to grow, such ...
Qingbo Wang, Viktor K. Prasanna