2079 search results - page 110 / 416 » Universality of random graphs |
123
click to vote
ENTCS
2008
15 years 4 months ago
2008
Abstract Machine Greg Manning1 Detlef Plump2 Department of Computer Science The University of York, UK duce the York Abstract Machine (YAM) for implementing the graph programming ...
133
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
329
click to vote
PAMI
2010
15 years 2 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
145
click to vote
MICCAI
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
151
click to vote
WDAG
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...