677 search results - page 124 / 136 » Bipartite roots of graphs |
STOC
1997
ACM
14 years 19 days ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
CVIU
2008
13 years 8 months ago
2008
This paper presents a novel framework for matching video sequences using the spatiotemporal segmentation of videos. Instead of using appearance features for region correspondence ...
DAM
2008
13 years 8 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...