1538 search results - page 98 / 308 » Spectral Techniques in Graph Algorithms |
114
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
146
click to vote
AI
2011
Springer
14 years 8 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
CVPR
2008
IEEE
15 years 3 months ago
2008
IEEE
Restoration of a degraded image from motion blurring is highly dependent on the estimation of the blurring kernel. Most of the existing motion deblurring techniques model the blur...
75
Voted
JSCIC
2008
15 years 1 months ago
2008
Abstract This paper proposes and implements a novel hybrid level set method which combines the numerical efficiency of the local level set approach with the temporal stability affo...
153
click to vote
ANTSW
2004
Springer
15 years 5 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...