4009 search results - page 389 / 802 » Clustering on Complex Graphs |
167
click to vote
AAAI
1990
15 years 8 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
172
click to vote
CORR
2007
Springer
15 years 6 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...
154
click to vote
IFIPTCS
2010
15 years 4 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...
194
click to vote
ICDAR
2009
IEEE
15 years 4 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. ...
199
click to vote
DCC
2011
IEEE
15 years 1 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 ...