650 search results - page 86 / 130 » Positive graphs |
ASPDAC
2006
ACM
14 years 3 months ago
2006
ACM
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
EMMCVPR
2005
Springer
14 years 3 months ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
ATAL
2008
Springer
13 years 12 months ago
2008
Springer
Behaviors in soccer-agent domains can involve individual plays, several players involved in tactical plays or the whole team trying to follow strategies supported by specific form...
AAAI
2010
13 years 11 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
NIPS
2008
13 years 11 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...