168 search results - page 15 / 34 » Shape Analysis by Graph Decomposition |
SLP
1997
13 years 11 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
ICMCS
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper, we incorporate a set of principles originated from cognitive psychology into the design of 3-D shape analysis and retrieval algorithms. Based on the “visual salie...
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
ICIP
2005
IEEE
14 years 3 months ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...