Sciweavers

11565 search results - page 321 / 2313
» Computing Minimal Mappings
Sort
View
COMBINATORICS
2007
87views more  COMBINATORICS 2007»
15 years 6 months ago
Recognizing Cluster Algebras of Finite Type
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
Ahmet I. Seven
ICPR
2008
IEEE
16 years 8 months ago
Generalized Nonlinear Discriminant Analysis
A Generalized Nonlinear Discriminant Analysis (GNDA) method is proposed, which implements Fisher discriminant analysis in a nonlinear mapping space. Linear discriminant analysis i...
Hua Zhang, Li Zhang, Licheng Jiao, Weida Zhou
EUROPAR
2009
Springer
15 years 11 months ago
Towards Metaprogramming for Parallel Systems on a Chip
We demonstrate that the performance of commodity parallel systems significantly depends on low-level details, such as storage layout and iteration space mapping, which motivates t...
Lee W. Howes, Anton Lokhmotov, Alastair F. Donalds...
IJON
2006
77views more  IJON 2006»
15 years 6 months ago
Synchronization effects using a piecewise linear map-based spiking-bursting neuron model
Models of neurons based on iterative maps allows the simulation of big networks of coupled neurons without loss of biophysical properties such as spiking, bursting or tonic bursti...
Carlos Aguirre, Doris Campos, Pedro Pascual, Eduar...
EUROCAST
2009
Springer
153views Hardware» more  EUROCAST 2009»
15 years 4 months ago
Algorithm for Testing the Leibniz Algebra Structure
Abstract. Given a basis of a vector space V over a field K and a multiplication table which defines a bilinear map on V , we develop a computer program on Mathematica which checks ...
José Manuel Casas, Manuel A. Insua, Manuel ...