Sciweavers

4565 search results - page 205 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
ICCS
2001
Springer
15 years 5 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
118
Voted
JSAC
2006
131views more  JSAC 2006»
15 years 16 days ago
On Dynamic Optimization of Packet Matching in High-Speed Firewalls
Abstract--Packet matching plays a critical role in the performance of many network devices and a tremendous amount of research has already been invested to come up with better opti...
Hazem Hamed, Adel El-Atawy, Ehab Al-Shaer
ICC
2007
IEEE
111views Communications» more  ICC 2007»
15 years 7 months ago
Computationally Efficient Optimal Discrete Bit Allocation for Medium and High Target Bit Rate DMT Transmissions
—A computationally efficient optimal discrete bit allocation algorithm is proposed for medium and high target bit rate discrete multitone (DMT) transmissions. Unlike conventional...
Li-ping Zhu, Xiaofeng Zhong, Yan Yao, Shi-wei Dong...
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 6 months ago
Solving large scale combinatorial optimization using PMA-SLS
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong, Meng Joo E...
CVPR
2010
IEEE
15 years 9 months ago
Fast Globally Optimal 2D Human Detection with Loopy Graph Models
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
Tai-Peng Tian, Stan Sclaroff