Sciweavers

146 search results - page 6 / 30
» The Fast Generalized Gauss Transform
Sort
View
CVPR
2010
IEEE
14 years 10 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
IPPS
2000
IEEE
15 years 4 months ago
A Novel Superscalar Architecture for Fast DCT Implementation
This paper presents a new superscalar architecture for fast discrete cosine transform (DCT). Comparing with the general SIMD architecture, it speeds up the DCT computation by a fac...
Zhang Yong, Min Zhang
ICA
2007
Springer
15 years 5 months ago
Robust Independent Component Analysis Using Quadratic Negentropy
We present a robust algorithm for independent component analysis that uses the sum of marginal quadratic negentropies as a dependence measure. It can handle arbitrary source densit...
Jaehyung Lee, Taesu Kim, Soo-Young Lee
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
15 years 5 months ago
The truncated fourier transform and applications
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
Joris van der Hoeven
CAD
2006
Springer
14 years 11 months ago
Fast computation of inertia through affinely extended Euler tensor
We introduce an affine extension of the Euler tensor which encompasses all of the inertia properties of interest in a convenient linear format, and we show how it transforms under...
Antonio DiCarlo, Alberto Paoluzzi