Sciweavers

4074 search results - page 164 / 815
» Defining Computational Aesthetics
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 10 months ago
The discrete Fourier transform: A canonical basis of eigenfunctions
We exhibit a canonical basis of eigenvectors for the discrete Fourier transform (DFT). The transition matrix from the standard basis to defines a novel transform which we call ...
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
CORR
2008
Springer
73views Education» more  CORR 2008»
13 years 10 months ago
Regularities of the distribution of abstract van der Corput sequences
TIES OF THE DISTRIBUTION OF ABSTRACT VAN DER CORPUT SEQUENCES WOLFGANG STEINER Abstract. Similarly to -adic van der Corput sequences, abstract van der Corput secan be defined by ab...
Wolfgang Steiner
DM
2010
126views more  DM 2010»
13 years 10 months ago
Asymptotic connectivity of hyperbolic planar graphs
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
Patrick Bahls, Michael R. Dipasquale
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 10 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison
IEICET
2008
76views more  IEICET 2008»
13 years 10 months ago
All Pairings Are in a Group
In this paper, we suggest that all pairings be in a group from an abstract angle. According to our results, we can define some new pairings with short Miller loops and hence speed ...
Changan Zhao, Fangguo Zhang, Jiwu Huang