9532 search results - page 175 / 1907 » Logic, Graphs, and Algorithms |
181
click to vote
COMGEO
2012
ACM
14 years 6 days ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
174
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
154
click to vote
HIPC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
126
click to vote
CEC
2007
IEEE
15 years 10 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
130
click to vote
ACSD
2003
IEEE
15 years 9 months ago
2003
IEEE
Signal Transition Graphs (STGs) are one of the most popular models for the specification of asynchronous circuits. A STG can be implemented if it admits a so-called consistent an...