1327 search results - page 185 / 266 » Path following algorithm for the graph matching problem |
125
Voted
CSL
2003
Springer
15 years 7 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
111
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
106
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
103
click to vote
ICIP
2000
IEEE
16 years 3 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
114
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...