1105 search results - page 73 / 221 » Linear choosability of graphs |
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which ...
105
click to vote
UAI
2008
15 years 1 months ago
2008
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
110
click to vote
ORL
2008
14 years 12 months ago
2008
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...
124
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Unique-sink orientations (USOs) are an abstract class of orientations of the ncube graph. We consider some classes of USOs that are of interest in connection with the linear compl...
JMLR
2006
14 years 12 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...