Sciweavers

580 search results - page 32 / 116
» On the memory complexity of the forward-backward algorithm
Sort
View
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
14 years 1 months ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood
CAIP
1999
Springer
145views Image Analysis» more  CAIP 1999»
13 years 12 months ago
Optimized Fast Algorithms for the Quaternionic Fourier Transform
Abstract. In this article, we deal with fast algorithms for the quaternionic Fourier transform (QFT). Our aim is to give a guideline for choosing algorithms in practical cases. Hen...
Michael Felsberg, Gerald Sommer
PSTV
1993
123views Hardware» more  PSTV 1993»
13 years 9 months ago
On the Verification of Temporal Properties
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
Patrice Godefroid, Gerard J. Holzmann
TEC
2010
203views more  TEC 2010»
13 years 2 months ago
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These nic...
Xiaodong Li
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 7 months ago
Finding low-weight polynomial multiples using discrete logarithm
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
Frédéric Didier, Yann Laigle-Chapuy