1201 search results - page 82 / 241 » Linear Probing and Graphs |
106
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
—We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical desig...
124
click to vote
AAECC
2007
Springer
15 years 10 months ago
2007
Springer
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C′ whose minimal trellis has the least state-compl...
115
click to vote
ICALP
2001
Springer
15 years 8 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 ...
148
click to vote
UAI
2008
15 years 5 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...
151
click to vote
ORL
2008
15 years 4 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...