Sciweavers

800 search results - page 19 / 160
» Gaussian random number generators
Sort
View
ICPPW
2003
IEEE
14 years 1 months ago
A Fault-tolerant Routing Strategy for Gaussian Cube Using Gaussian Tree
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...
Loh Peter, Xinhua Zhang
IJAC
2008
97views more  IJAC 2008»
13 years 8 months ago
Random Generation of Finitely Generated Subgroups of a Free Group
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
Frédérique Bassino, Cyril Nicaud, Pa...
WCE
2007
13 years 9 months ago
On the Statistical Distribution of Stationary Segment Lengths of Road Vehicles Vibrations
— This paper presents an important outcome of a research programme which focuses on the development of a method for synthesizing, under controlled conditions in the laboratory, t...
Vincent Rouillard
COCOON
2005
Springer
14 years 1 months ago
Randomized Quicksort and the Entropy of the Random Source
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
Beatrice List, Markus Maucher, Uwe Schöning, ...
ICONIP
2007
13 years 9 months ago
Discovery of Linear Non-Gaussian Acyclic Models in the Presence of Latent Classes
Abstract. An effective way to examine causality is to conduct an experiment with random assignment. However, in many cases it is impossible or too expensive to perform controlled ...
Shohei Shimizu, Aapo Hyvärinen