Sciweavers

4744 search results - page 98 / 949
» Connected Computing
Sort
View
INFOCOM
1995
IEEE
15 years 9 months ago
Computing Approximate Blocking Probabilities for a Class of All-Optical Networks
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a ...
Alexander Birman
JSC
2007
84views more  JSC 2007»
15 years 6 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
GC
2010
Springer
15 years 4 months ago
Enumerative Properties of Rooted Circuit Maps
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar g...
Zhicheng Gao, Han Ren
HPDC
1993
IEEE
15 years 10 months ago
An Analysis of Distributed Computing Software and Hardware for Applications in Computational Physics
We have implemented a set of computational physics codes on a network of IBM RS/6000 workstations used as a distributed parallel computer. We compare the performance of the codes ...
Paul D. Coddington
COCOON
2008
Springer
15 years 8 months ago
Dimensions of Points in Self-similar Fractals
We use nontrivial connections between the theory of computing and the finescale geometry of Euclidean space to give a complete analysis of the dimensions of individual points in f...
Jack H. Lutz, Elvira Mayordomo