2314 search results - page 117 / 463 » Minimal Partitions of a Graph |
133
Voted
EMMCVPR
2001
Springer
15 years 8 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
132
Voted
SODA
1992
ACM
15 years 4 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
124
Voted
ICDCS
2003
IEEE
15 years 9 months ago
2003
IEEE
Mobile code carried by a mobile agent can automatically travel to several data sources in order to complete a designated program. Traditionally, most mobile agent systems [7][8][1...
136
Voted
ESA
2008
Springer
15 years 5 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
121
click to vote
VLSID
1996
IEEE
15 years 7 months ago
1996
IEEE
Existing systolic architectures for the LMS algorithm with delayed coeficient adaptation have large adaptation delay and hence degraded convergence behaviour. This paper presents ...