1327 search results - page 135 / 266 » Path following algorithm for the graph matching problem |
152
click to vote
FPGA
1995
ACM
15 years 7 months ago
1995
ACM
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
147
click to vote
BIRTHDAY
2010
Springer
15 years 5 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
145
click to vote
GD
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
125
Voted
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Region based features are getting popular due to their higher descriptive power relative to other features. However, real world images exhibit changes in image segments capturing ...
150
Voted
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...