129 search results - page 16 / 26 » Lower Bounds of Computational Power of a Synaptic Calculus |
ICALP
2003
Springer
14 years 20 days ago
2003
Springer
Recently, Fabrikant, Koutsoupias and Papadimitriou [7] introduced a natural and beautifully simple model of network growth involving a trade-off between geometric and network obje...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
ICDCN
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
SIAMNUM
2011
13 years 2 months ago
2011
In the context of mesh adaptation, Riemannian metric spaces have been used to prescribe orientation, density and stretching of anisotropic meshes. But, such structures are only con...