Sciweavers

1806 search results - page 31 / 362
» Randomness and halting probabilities
Sort
View
ICMLA
2007
13 years 9 months ago
Maximum Likelihood Quantization of Genomic Features Using Dynamic Programming
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...
Mingzhou (Joe) Song, Robert M. Haralick, Sté...
IPPS
1999
IEEE
13 years 11 months ago
Randomized Initialization Protocols for Packet Radio Networks
The main contribution of this work is to propose efficient randomized leader election and initialization protocols for Packet Radio Networks (PRN, for short). As a result of the i...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
APAL
2008
92views more  APAL 2008»
13 years 7 months ago
The complexity of random ordered structures
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
Joel H. Spencer, Katherine St. John
GD
1998
Springer
13 years 11 months ago
Using Graph Layout to Visualize Train Interconnection Data
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
Ulrik Brandes, Dorothea Wagner
ISIPTA
1999
IEEE
116views Mathematics» more  ISIPTA 1999»
13 years 11 months ago
On the Distribution of Natural Probability Functions
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
Jeff B. Paris, Paul N. Watton, George M. Wilmers