Sciweavers

1806 search results - page 72 / 362
» Randomness and halting probabilities
Sort
View
COMBINATORICS
2000
89views more  COMBINATORICS 2000»
13 years 8 months ago
A Note on the Non-Colorability Threshold of a Random Graph
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C....
CORR
2008
Springer
70views Education» more  CORR 2008»
13 years 9 months ago
Random Vandermonde Matrices-Part II: Applications
In this paper, we review some potential applications of random Vandermonde matrices in the field of signal processing and wireless communications. Using asymptotic results based on...
Øyvind Ryan, Mérouane Debbah
JCT
2008
65views more  JCT 2008»
13 years 8 months ago
Random graphs on surfaces
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
Colin McDiarmid
TIT
2008
106views more  TIT 2008»
13 years 8 months ago
Byzantine Modification Detection in Multicast Networks With Random Network Coding
This paper gives an information theoretic approach for detecting Byzantine modifications in networks employing random linear network coding. Each exogenous source packet is augmen...
Tracey Ho, Ben Leong, Ralf Koetter, Muriel M&eacut...
ICPR
2002
IEEE
14 years 10 months ago
Robust Appearance-Based Object Recognition Using a Fully Connected Markov Random Field
This paper presents a new kernel method for appearance-based object recognition, highly robust to noise and occlusion. It consists of a fully connected Markov Random Field that in...
Barbara Caputo, Sahla Bouattour, Heinrich Niemann