Sciweavers

2996 search results - page 17 / 600
» Numberings and Randomness
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 8 months ago
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Emmanuel J. Candès, Yaniv Plan
RSA
1998
105views more  RSA 1998»
13 years 9 months ago
The chromatic numbers of random hypergraphs
: For a pair of integers 1F␥-r, the ␥-chromatic number of an r-uniform Ž .hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < <T ...
Michael Krivelevich, Benny Sudakov
FCT
2009
Springer
14 years 4 months ago
Martingales on Trees and the Empire Chromatic Number of Random Trees
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
Colin Cooper, Andrew R. A. McGrae, Michele Zito
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 10 months ago
Distributed Sensor Localization in Random Environments using Minimal Number of Anchor Nodes
Abstract--The paper introduces DILOC, a distributed, iterative algorithm to locate sensors (with unknown locations) in 1, with respect to a minimal number of + 1 anchors with known...
Usman A. Khan, Soummya Kar, José M. F. Mour...
DAM
2008
116views more  DAM 2008»
13 years 10 months ago
Expected number of breakpoints after t random reversals in genomes with duplicate genes
In comparative genomics, one wishes to deduce the evolutionary distance between dierent species by studying their genomes. Using gene order information, we seek the number of time...
Niklas Eriksen