1327 search results - page 81 / 266 » Path following algorithm for the graph matching problem |
120
Voted
ICCAD
1994
IEEE
15 years 6 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
122
click to vote
FUN
2007
Springer
15 years 5 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
112
click to vote
STRINGOLOGY
2008
15 years 3 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
166
click to vote
EDBT
2011
ACM
14 years 5 months ago
2011
ACM
This paper introduces the problem of matching people names to their corresponding social network identities such as their Twitter accounts. Existing tools for this purpose build u...
129
Voted
SIAMCOMP
1998
15 years 1 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...