Sciweavers

1523 search results - page 188 / 305
» The Computational Complexity of Linear Optics
Sort
View
ICCAD
1995
IEEE
127views Hardware» more  ICCAD 1995»
15 years 7 months ago
Hybrid decision diagrams
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
Edmund M. Clarke, Masahiro Fujita, Xudong Zhao
ARCS
2008
Springer
15 years 6 months ago
An Optimized ZGEMM Implementation for the Cell BE
: The architecture of the IBM Cell BE processor represents a new approach for designing CPUs. The fast execution of legacy software has to stand back in order to achieve very high ...
Timo Schneider, Torsten Hoefler, Simon Wunderlich,...
JOC
2008
92views more  JOC 2008»
15 years 4 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay
PAMI
2006
125views more  PAMI 2006»
15 years 3 months ago
Channel Smoothing: Efficient Robust Smoothing of Low-Level Signal Features
In this paper, we present a new and efficient method to implement robust smoothing of low-level signal features: B-spline channel smoothing. This method consists of three steps: en...
Michael Felsberg, Per-Erik Forssén, Hanno S...
TSP
2008
98views more  TSP 2008»
15 years 3 months ago
Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
Roland Badeau, Gaël Richard, Bertrand David