Sciweavers

27692 search results - page 5432 / 5539
» Where is ...
Sort
View
CVPR
2011
IEEE
13 years 3 months ago
2D Nonrigid Partial Shape Matching Using MCMC and Contour Subdivision
Shape matching has many applications in computer vision, such as shape classification, object recognition, object detection, and localization. In 2D cases, shape instances are 2D c...
Y. Cao, Z. Zhang, I. Czogiel, I. Dryden, S. Wang
AI
2011
Springer
13 years 2 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
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 ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
AI
2011
Springer
13 years 2 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
AIEDAM
2011
13 years 2 months ago
Discovering implicit constraints in design
In familiar design domains, expert designers are able to quickly focus on “good designs”, based on constraints they have learned while exploring the design space. This ability ...
Madan Mohan Dabbeeru, Amitabha Mukerjee
ALGORITHMICA
2011
13 years 2 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick
« Prev « First page 5432 / 5539 Last » Next »