1327 search results - page 187 / 266 » Path following algorithm for the graph matching problem |
143
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
100
click to vote
ASPDAC
2009
ACM
15 years 5 months ago
2009
ACM
—Redundant via insertion is a widely recommended technique to enhance the via yield and reliability. In this paper, the post-routing redundant via insertion problem is transforme...
132
click to vote
SPAA
2006
ACM
15 years 7 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
143
click to vote
PAMI
2010
15 years 6 days ago
2010
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
108
click to vote
MOR
2006
15 years 1 months ago
2006
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...