Sciweavers

171 search results - page 15 / 35
» Maximally fast and arbitrarily fast implementation of linear...
Sort
View
SPAA
1999
ACM
14 years 19 hour ago
Recursive Array Layouts and Fast Parallel Matrix Multiplication
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
ICMCS
2005
IEEE
124views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Fast inter frame encoding based on modes pre-decision in H.264
The new video coding standard, H.264 allows motion estimation performing on tree-structured block partitioning and multiple reference frames. This feature improves the prediction ...
Dongming Zhang, Yanfei Shen, Shouxun Lin, Yongdong...
FPGA
2003
ACM
116views FPGA» more  FPGA 2003»
14 years 28 days ago
Hardware-assisted simulated annealing with application for fast FPGA placement
To truly exploit FPGAs for rapid turn-around development and prototyping, placement times must be reduced to seconds; latebound, reconfigurable computing applications may demand p...
Michael G. Wrighton, André DeHon
ICML
2007
IEEE
14 years 8 months ago
Trust region Newton methods for large-scale logistic regression
Large-scale logistic regression arises in many applications such as document classification and natural language processing. In this paper, we apply a trust region Newton method t...
Chih-Jen Lin, Ruby C. Weng, S. Sathiya Keerthi
ICML
2009
IEEE
14 years 8 months ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...