Sciweavers

257 search results - page 3 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
JCP
2008
145views more  JCP 2008»
13 years 6 months ago
Impact of Shift Operations on (-1+j)-Base Complex Binary Numbers
Complex numbers play a very important role in various applications of electrical and computer engineering. These days, arithmetic operations dealing with these numbers rely on a &q...
Tariq Jamil
WWW
2009
ACM
14 years 7 months ago
A geographical analysis of knowledge production in computer science
We analyze knowledge production in Computer Science by means of coauthorship networks. For this, we consider 30 graduate programs of different regions of the world, being 8 progra...
Alberto H. F. Laender, Guilherme Vale Menezes, Niv...
ICASSP
2011
IEEE
12 years 10 months ago
Spatial sound reproduction systems using higher order loudspeakers
Sound reproduction systems aim to produce a desired sound field over a region of space. At high frequencies, the number of loudspeakers required is prohibitive. This paper shows t...
Mark A. Poletti, Thushara D. Abhayapala
CSR
2006
Springer
13 years 10 months ago
Complexity of Polynomial Multiplication over Finite Fields
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
Michael Kaminski
COMPGEOM
2008
ACM
13 years 8 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...