118 search results - page 2 / 24 » Two k-winners-take-all networks with discontinuous activatio... |
ISCI
2008
13 years 4 months ago
2008
In this paper, two modified constrained learning algorithms are proposed to obtain better generalization performance and faster convergence rate. The additional cost terms of the ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The transmission capacity of an ad-hoc network is the maximum density of active transmitters in an unit area, given an outage constraint at each receiver for a fixed rate of transm...
IJCV
2006
13 years 5 months ago
2006
We propose a new algorithm for dense optical flow computation. Dense optical flow schemes are challenged by the presence of motion discontinuities. In state of the art optical flo...
ICCD
2002
IEEE
14 years 2 months ago
2002
IEEE
We represent switching activity in VLSI circuits using a graphical probabilistic model based on Cascaded Bayesian Networks (CBN’s). We develop an elegant method for maintaining ...
LCN
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Active measurements on network paths provide endto-end network health status in terms of metrics such as bandwidth, delay, jitter and loss. Hence, they are increasingly ...