Sciweavers

5 search results - page 1 / 1
» Clifford algebras and approximating the permanent
Sort
View
STOC
2002
ACM
90views Algorithms» more  STOC 2002»
14 years 5 months ago
Clifford algebras and approximating the permanent
Steve Chien, Lars Eilstrup Rasmussen, Alistair Sin...
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 2 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan
VISUALIZATION
1997
IEEE
13 years 9 months ago
Visualization of higher order singularities in vector fields
We present an algorithm for the visualization of vector field topology based on Clifford algebra. It is the first method allowing the detection of higher order singularities. Th...
Gerik Scheuermann, Hans Hagen, Heinz Krüger, ...
AFPAC
2000
Springer
257views Mathematics» more  AFPAC 2000»
13 years 9 months ago
The Multidimensional Isotropic Generalization of Quadrature Filters in Geometric Algebra
In signal processing, the approach of the analytic signal is a capable and often used method. For signals of finite length, quadrature filters yield a bandpass filtered approxim...
Michael Felsberg, Gerald Sommer
CAGD
2004
141views more  CAGD 2004»
13 years 4 months ago
Almost rotation-minimizing rational parametrization of canal surfaces
Almost rotation minimizing parametrization of the canal surface is given. The basic building block of our approach is the curve approximation scheme that enables us to construct a...
Hyeong In Choi, Song-Hwa Kwon, Nam-Sook Wee