Sciweavers

1806 search results - page 86 / 362
» Randomness and halting probabilities
Sort
View
COMBINATORICA
2011
12 years 8 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
INFOCOM
2009
IEEE
14 years 3 months ago
Random Linear Network Coding For Time Division Duplexing: When To Stop Talking And Start Listening
—A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes...
Daniel Enrique Lucani, Milica Stojanovic, Muriel M...
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 3 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 8 months ago
Free deconvolution for signal processing applications
—Situations in many fields of research, such as digital communications, nuclear physics and mathematical finance, can be modelled with random matrices. When the matrices get la...
Øyvind Ryan, Mérouane Debbah
INFORMATICALT
2000
79views more  INFORMATICALT 2000»
13 years 8 months ago
Influence of Projection Pursuit on Classification Errors: Computer Simulation Results
Abstract. Influence of projection pursuit on classification errors and estimates of a posteriori probabilities from the sample is considered. Observed random variable is supposed t...
Gintautas Jakimauskas, Ricardas Krikstolaitis