Sciweavers

79 search results - page 4 / 16
» Hardware-Based Implementation of the Common Approximate Subs...
Sort
View
ICASSP
2008
IEEE
15 years 3 months ago
A fast approximate joint diagonalization algorithm using a criterion with a block diagonal weight matrix
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
Petr Tichavský, Arie Yeredor, Jan Nielsen
ISCAS
2003
IEEE
100views Hardware» more  ISCAS 2003»
15 years 2 months ago
Area-effective FIR filter design for multiplier-less implementation
The hardware complexity of digital filters is not controllable by straightforwardly rounding the coefficients to the quantization levels. In this paper, we propose an effective al...
Tay-Jyi Lin, Tsung-Hsun Yang, Chein-Wei Jen
ICML
2006
IEEE
15 years 10 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
ISSAC
2004
Springer
118views Mathematics» more  ISSAC 2004»
15 years 2 months ago
The approximate GCD of inexact polynomials
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
Zhonggang Zeng, Barry H. Dayton
CAD
2006
Springer
14 years 9 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin