Sciweavers

5922 search results - page 328 / 1185
» Navigability of Complex Networks
Sort
View
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
15 years 8 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
124
Voted
GRAPHICSINTERFACE
1998
15 years 5 months ago
Lighting Networks - A New Approach for Designing Lighting Algorithms
In the past, new global illumination algorithms have usually been designed as a single module that was responsible for the simulation of all aspects of illumination in a scene. A ...
Philipp Slusallek, Marc Stamminger, Hans-Peter Sei...
BIB
2008
93views more  BIB 2008»
15 years 4 months ago
A structured approach for the engineering of biochemical network models, illustrated for signalling pathways
Quantitative models of biochemical networks (signal transduction cascades, metabolic pathways, gene regulatory circuits) are a central component of modern systems biology. Buildin...
Rainer Breitling, David Gilbert, Monika Heiner, Ri...
BMCBI
2007
202views more  BMCBI 2007»
15 years 4 months ago
ProtNet: a tool for stochastic simulations of protein interaction networks dynamics
Background: Protein interactions support cell organization and mediate its response to any specific stimulus. Recent technological advances have produced large data-sets that aim ...
Massimo Bernaschi, Filippo Castiglione, Alessandra...
ICC
2009
IEEE
15 years 1 months ago
Selecting Concurrent Network Architectures at Runtime
The current Internet architecture nicely structures functionality into layers of protocols. While this reduces complexity, many tweaks have emerged because of the architecture'...
Lars Völker, Denis Martin, Christoph Werle, M...