1729 search results - page 196 / 346 » Bound Graph Polysemy |
267
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
198
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
169
click to vote
INFOCOM
2005
IEEE
16 years 4 hour ago
2005
IEEE
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
191
click to vote
PDP
2005
IEEE
15 years 12 months ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
165
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...