Sciweavers

3731 search results - page 420 / 747
» cases 2006
Sort
View
155
Voted
IJON
2007
73views more  IJON 2007»
15 years 6 months ago
Improvement of spike coincidence detection with facilitating synapses
A realistic model of activity dependent dynamical synapses is used to study the conditions in which a postsynaptic neuron detects temporal coincidences of spikes arriving from N d...
Jorge F. Mejías, Joaquín J. Torres
IJON
2007
119views more  IJON 2007»
15 years 6 months ago
Finite sample effects of the fast ICA algorithm
Many algorithms for independent component analysis (ICA) and blind source separation (BSS) can be considered particular instances of a criterion based on the sum of two terms: C(Y...
Sergio Bermejo
COMBINATORICS
2004
115views more  COMBINATORICS 2004»
15 years 6 months ago
Dense Packings of Equal Spheres in a Cube
We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to improve the convergence of this...
Thierry Gensane
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
15 years 6 months ago
Automorphisms and Enumeration of Switching Classes of Tournaments
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
László Babai, Peter J. Cameron
COMBINATORICS
2000
124views more  COMBINATORICS 2000»
15 years 6 months ago
Colouring Planar Mixed Hypergraphs
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
André Kündgen, Eric Mendelsohn, Vitaly...