2695 search results - page 148 / 539 » Learning Graph Matching |
102
click to vote
ICCAD
2003
IEEE
15 years 11 months ago
2003
IEEE
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
112
click to vote
IVC
2007
15 years 2 months ago
2007
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
108
click to vote
WSDM
2009
ACM
15 years 9 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
149
click to vote
SIGMOD
2010
ACM
15 years 1 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
148
click to vote
ICMLA
2010
15 years 27 days ago
2010
Learning the reward function of an agent by observing its behavior is termed inverse reinforcement learning and has applications in learning from demonstration or apprenticeship l...