Sciweavers

93 search results - page 19 / 19
» Towards Correspondence Carrying Specifications
Sort
View
JSAC
2006
157views more  JSAC 2006»
13 years 5 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
NN
2006
Springer
126views Neural Networks» more  NN 2006»
13 years 5 months ago
Selective attention through phase relationship of excitatory and inhibitory input synchrony in a model cortical neuron
Neurons in area V 2 and V 4 exhibit stimulus specific tuning to single stimuli, and respond at intermediate firing rates when presented with two differentially preferred stimuli (...
Jyoti Mishra, Jean-Marc Fellous, Terrence J. Sejno...
CISS
2008
IEEE
14 years 13 days ago
Information theory based estimator of the number of sources in a sparse linear mixing model
—In this paper we present an Information Theoretic Estimator for the number of sources mutually disjoint in a linear mixing model. The approach follows the Minimum Description Le...
Radu Balan