Sciweavers

522 search results - page 84 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
94
Voted
BC
2008
72views more  BC 2008»
15 years 2 months ago
Spike-train spectra and network response functions for non-linear integrate-and-fire neurons
Reduced models have long been used as a tool for the analysis of the complex activity taking place in neurons and their coupled networks. Recent advanced in experimental and theore...
Magnus J. E. Richardson
153
Voted
BMCBI
2010
178views more  BMCBI 2010»
15 years 2 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
151
Voted
GI
2004
Springer
15 years 8 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
109
Voted
IPPS
2007
IEEE
15 years 9 months ago
Strategies for Replica Placement in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
Anne Benoit, Veronika Rehn, Yves Robert
114
Voted
TPDS
2008
72views more  TPDS 2008»
15 years 2 months ago
Replica Placement and Access Policies in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and Quality of Service (QoS) constraints. The client requests ...
Anne Benoit, Veronika Rehn-Sonigo, Yves Robert