2612 search results - page 218 / 523 » Switching Graphs and Their Complexity |
135
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
119
click to vote
IFIPTCS
2010
15 years 2 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
146
click to vote
ICDAR
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
160
click to vote
DCC
2011
IEEE
14 years 11 months ago
2011
IEEE
We show that (n, 2n ) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to ...
175
click to vote
TIP
2011
14 years 11 months ago
2011
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...