Sciweavers

4298 search results - page 30 / 860
» Measurable chromatic numbers
Sort
View
DM
2008
69views more  DM 2008»
13 years 7 months ago
Connectedness of the graph of vertex-colourings
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
Luis Cereceda, Jan van den Heuvel, Matthew Johnson
CORR
2011
Springer
184views Education» more  CORR 2011»
13 years 2 months ago
Acyclic and Star Colorings of Cographs
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
Andrew Lyons
COLING
2002
13 years 7 months ago
A Measure of Term Representativeness Based on the Number of Co-occurring Salient Words
We propose a novel measure of the representativeness (i.e., indicativeness or topic specificity) of a term in a given corpus. The measure embodies the idea that the distribution o...
Toru Hisamitsu, Yoshiki Niwa
IMC
2003
ACM
14 years 20 days ago
On the number of distributed measurement points for network tomography
Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferre...
Joseph Douglas Horton, Alejandro López-Orti...
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 5 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