Sciweavers

113 search results - page 8 / 23
» Data structures with dynamical random transitions
Sort
View
CGF
2008
110views more  CGF 2008»
13 years 10 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
INFOCOM
2006
IEEE
14 years 3 months ago
On the Potential of Structure-Free Data Aggregation in Sensor Networks
— Data aggregation protocols can reduce the cost of communication, thereby extending the lifetime of sensor networks. Prior work on data aggregation protocols has focused on tree...
Kai-Wei Fan, Sha Liu, Prasun Sinha
BIOCOMP
2006
13 years 11 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer
MPC
2010
Springer
181views Mathematics» more  MPC 2010»
14 years 2 months ago
Process Algebras for Collective Dynamics
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
Jane Hillston
NECO
2010
147views more  NECO 2010»
13 years 8 months ago
Connectivity, Dynamics, and Memory in Reservoir Computing with Binary and Analog Neurons
Abstract: Reservoir Computing (RC) systems are powerful models for online computations on input sequences. They consist of a memoryless readout neuron which is trained on top of a ...
Lars Büsing, Benjamin Schrauwen, Robert A. Le...