Results 161 to 170 of about 5,839 (198)
Some of the next articles are maybe not open access.
Embedding hierarchical hypercube networks into the hypercube
IEEE Transactions on Parallel and Distributed Systems, 1997The embedding of one interconnection network into another is a very important issue in the design and analysis of parallel algorithms. Through such embeddings, the algorithms originally developed for one architecture can be directly mapped to another architecture.
Hamdi, Mounir, Song, SW
openaire +2 more sources
Fault tolerance of hypercubes and folded hypercubes
The Journal of Supercomputing, 2013Let $$G = (V,E)$$ G = ( V , E ) be a connected graph. The conditional edge connectivity $$\lambda _\delta ^k(G)$$ ? ? k ( G ) is the cardinality of the minimum edge cuts, if any, whose deletion disconnects $$G$$ G and each component of $$G - F$$ G - F has $$\delta \ge k$$ ? ? k .
Guo, Litao, Guo, Xiaofeng
openaire +2 more sources
Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1, 1988
The widespread use of parallel machines, and hypercubes in particular, is being held back by the lack of high-order parallel programming languages. In this paper we discuss the issues involved in establishing an existing language that supports parallel processing, that is to say Ada, on a hypercube multiprocessor.
Russell M. Clapp, Trevor N. Mudge
openaire +1 more source
The widespread use of parallel machines, and hypercubes in particular, is being held back by the lack of high-order parallel programming languages. In this paper we discuss the issues involved in establishing an existing language that supports parallel processing, that is to say Ada, on a hypercube multiprocessor.
Russell M. Clapp, Trevor N. Mudge
openaire +1 more source
Structure Fault Tolerance of Hypercubes and Folded Hypercubes
Theoretical Computer Science, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eminjan Sabir
exaly +2 more sources
Graphs and Combinatorics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Proceedings of the third conference on Hypercube concurrent computers and applications -, 1988
We report our progress on computer chess last described at the Second Conference on Hypercubes. Our program follows the strategy of currently successful sequential chess programs: searching of an alpha-beta pruned game tree, iterative deepening, transposition and history tables, specialized endgame evaluators, and so on.
Felton, Edward W., Otto, Steve W.
openaire +2 more sources
We report our progress on computer chess last described at the Second Conference on Hypercubes. Our program follows the strategy of currently successful sequential chess programs: searching of an alpha-beta pruned game tree, iterative deepening, transposition and history tables, specialized endgame evaluators, and so on.
Felton, Edward W., Otto, Steve W.
openaire +2 more sources
2009
Bernstein's CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r , a block byte size b , and a digest bit length h (the compression function makes r rounds, while the finalization function makes 10r rounds).
Jean-Philippe Aumasson +4 more
openaire +3 more sources
Bernstein's CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r , a block byte size b , and a digest bit length h (the compression function makes r rounds, while the finalization function makes 10r rounds).
Jean-Philippe Aumasson +4 more
openaire +3 more sources
IEEE International Conference on Neural Networks, 2002
A discussion on learning from a geometric point of view is presented. Its main purpose is to obtain ways of pre-estimating the weights and thresholds of a neural network and of analyzing the corresponding effects on the learning procedure speed. It is conceivable that even a rough preliminary evaluation of the position of the hyperplanes will improve ...
Volnei A. Pedroni, Amnon Yariv
openaire +1 more source
A discussion on learning from a geometric point of view is presented. Its main purpose is to obtain ways of pre-estimating the weights and thresholds of a neural network and of analyzing the corresponding effects on the learning procedure speed. It is conceivable that even a rough preliminary evaluation of the position of the hyperplanes will improve ...
Volnei A. Pedroni, Amnon Yariv
openaire +1 more source
Information Processing Letters, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaojun Shen, Edward M. Reingold
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaojun Shen, Edward M. Reingold
openaire +1 more source
2006
In this paper we propose a semi-distributed self-diagnostic algorithm for Hypercube networks which is based on the use of a combinatorial structure known as the Hadamard matrix. We propose a model for providing fault- tolerance to the diagnostic scheme and to analyze the performance of the proposed diagnostic scheme.
Arif Ghafoor, Patrick Solé
openaire +2 more sources
In this paper we propose a semi-distributed self-diagnostic algorithm for Hypercube networks which is based on the use of a combinatorial structure known as the Hadamard matrix. We propose a model for providing fault- tolerance to the diagnostic scheme and to analyze the performance of the proposed diagnostic scheme.
Arif Ghafoor, Patrick Solé
openaire +2 more sources