Sciweavers

2157 search results - page 92 / 432
» Optimal Fast Hashing
Sort
View
VLSID
2005
IEEE
100views VLSI» more  VLSID 2005»
16 years 4 months ago
A Fast Buffered Routing Tree Construction Algorithm under Accurate Delay Model
Buffer insertion method plays a great role in modern VLSI design. Many buffer insertion algorithms have been proposed in recent years. However, most of them used simplified delay ...
Yibo Wang, Yici Cai, Xianlong Hong
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
15 years 10 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
TCOM
2010
83views more  TCOM 2010»
14 years 11 months ago
Global and Fast Receiver Antenna Selection for MIMO Systems
Abstract--For a multiple-input multiple-output (MIMO) system with more antennas at the receiver than the transmitter, selecting the same number of receiver antennas as the number o...
Bu Hong Wang, Hon Tat Hui, Mook Seng Leong
ISPEC
2010
Springer
15 years 9 months ago
On Fast and Approximate Attack Tree Computations
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
Aivo Jürgenson, Jan Willemson
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 8 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn