Sciweavers

171 search results - page 6 / 35
» Maximally fast and arbitrarily fast implementation of linear...
Sort
View
ISCAS
1994
IEEE
119views Hardware» more  ISCAS 1994»
13 years 11 months ago
Fast Design Algorithms for FIR Notch Filters
Based on symmetry of the maximally flat frequency response of a FIR notch filter the new design procedure is developed. The closed form solution provides direct computation of the...
Miroslav Vlcek, Ladislav Jires
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
14 years 4 months ago
Fast and robust quadratic placement combined with an exact linear net model
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
Peter Spindler, Frank M. Johannes
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
14 years 27 days ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
14 years 1 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
ICPR
2002
IEEE
14 years 8 months ago
A Fast Leading Eigenvector Approximation for Segmentation and Grouping
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
Antonio Robles-Kelly, Sudeep Sarkar, Edwin R. Hanc...