1983 search results - page 8 / 397 » Competitive graph searches |
AIPS
2004
13 years 9 months ago
2004
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
CCCG
2008
13 years 9 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
SIROCCO
2001
13 years 9 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
15 years 2 months ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...