Sciweavers

11371 search results - page 254 / 2275
» The network inhibition problem
Sort
View
GLOBECOM
2008
IEEE
16 years 1 months ago
Exploiting Partial Cooperation for Source and Channel Coding in Sensor Networks
Abstract—A network with two sensors communicating a remote measurement to a common access point (AP) is investigated. The sensors are connected via out-of-band and finite-capaci...
Osvaldo Simeone
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 6 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
15 years 5 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam
IDEAL
2004
Springer
16 years 2 days ago
DIVACE: Diverse and Accurate Ensemble Learning Algorithm
In order for a neural network ensemble to generalise properly, two factors are considered vital. One is the diversity and the other is the accuracy of the networks that comprise th...
Arjun Chandra, Xin Yao
HIS
2004
15 years 8 months ago
Q'tron Neural Networks for Constraint Satisfaction
This paper proposes the methods to solve the constraint satisfaction problems (CSPs) using Q'tron neural networks (NNs). A Q'tron NN is local-minima free if it is built ...
Tai-Wen Yue, Mei-Ching Chen