Results 221 to 230 of about 24,777 (243)
Some of the next articles are maybe not open access.
SIAM Journal on Discrete Mathematics, 2005
Let G be a connected bipartite graph. An involution $\alpha$ of G that preserves the bipartition of G is called bipartite. Let $G^\alpha$ be the graph obtained from G by adding to G the natural perfect matching induced by $\alpha$.
Bostjan Bresar +3 more
openaire +2 more sources
Let G be a connected bipartite graph. An involution $\alpha$ of G that preserves the bipartition of G is called bipartite. Let $G^\alpha$ be the graph obtained from G by adding to G the natural perfect matching induced by $\alpha$.
Bostjan Bresar +3 more
openaire +2 more sources
Proceedings of the third conference on Hypercube concurrent computers and applications -, 1988
We describe a hypercube ray-tracing program for rendering computer graphics. For small models, which fit in the memory of a single processor, the ray-tracer uses a scattered decomposition of pixels to balance the load, and achieves a very high efficiency.
Salmon, John, Goldsmith, Jeff
openaire +3 more sources
We describe a hypercube ray-tracing program for rendering computer graphics. For small models, which fit in the memory of a single processor, the ray-tracer uses a scattered decomposition of pixels to balance the load, and achieves a very high efficiency.
Salmon, John, Goldsmith, Jeff
openaire +3 more sources
Classifying Hyperplanes in Hypercubes
SIAM Journal on Discrete Mathematics, 1996We consider hyperplanes spanned by vertices of the unit d-cube. We classify these hyperplanes by parallelism to coordinate axes, by symmetry of the d-cube vertices they avoid, as well as by so-called hull-honesty. (Hull-honest hyperplanes are those whose intersection figure with the d-cube coincides with the convex hull of the d-cube vertices they ...
Oswin Aichholzer, Franz Aurenhammer
openaire +2 more sources
1992
New approach to the fragmentation problem of hypercube multiprocessors with dynamic allocation of subcubes is proposed. It is based on constructing Hamiltonian circuits of incomplete hypercubes. The main result is a constructive proof that an n-cube from which up to n−2 vertex-disjoint subcubes are removed so that it remains connected is a Hamiltonian ...
openaire +2 more sources
New approach to the fragmentation problem of hypercube multiprocessors with dynamic allocation of subcubes is proposed. It is based on constructing Hamiltonian circuits of incomplete hypercubes. The main result is a constructive proof that an n-cube from which up to n−2 vertex-disjoint subcubes are removed so that it remains connected is a Hamiltonian ...
openaire +2 more sources
2012
We define hypercubes of duality—of which the modern square of opposition is an emblematic example—in proper mathematical terms, as orbits under some action of the additive group \(\mathbb{Z}_{2}^{m}\), with m∈ℕ. We then introduce a notion of dimension for duality in classical logic and show, for example, how propositional expressions in at most three ...
openaire +2 more sources
We define hypercubes of duality—of which the modern square of opposition is an emblematic example—in proper mathematical terms, as orbits under some action of the additive group \(\mathbb{Z}_{2}^{m}\), with m∈ℕ. We then introduce a notion of dimension for duality in classical logic and show, for example, how propositional expressions in at most three ...
openaire +2 more sources
[1989] Proceedings. The 9th International Conference on Distributed Computing Systems, 2003
openaire +2 more sources
openaire +2 more sources
Latin Hypercube Sampling and the Propagation of Uncertainty in Analyses of Complex Systems
Reliability Engineering and System Safety, 2003J C Helton
exaly
Optimal embedding of hypercube into exchanged hypercube and optical multi-mesh hypercube
International Journal of Parallel, Emergent and Distributed SystemsPaul Immanuel, A. Berin Greeni
openaire +2 more sources
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems, 1991S Latifi, A El-Amawy
exaly