1802 search results - page 135 / 361 » Sparse Computations with PEI |
106
click to vote
TKDE
2012
13 years 14 days ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
ISBI
2008
IEEE
15 years 10 months ago
2008
IEEE
Here we present a scalable method to compute the structure of causal links over large scale dynamical systems that achieves high efficiency in discovering actual functional connec...
NIPS
2004
14 years 11 months ago
2004
This paper explores the computational consequences of simultaneous intrinsic and synaptic plasticity in individual model neurons. It proposes a new intrinsic plasticity mechanism ...
108
click to vote
CORR
2010
Springer
14 years 5 months ago
2010
Springer
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
EWSN
2012
Springer
13 years 5 months ago
2012
Springer
Empirical studies on link blacklisting show that the delivery rate is very sensitive to the calibration of the blacklisting threshold. If the calibration is too restrictive (the th...