1327 search results - page 134 / 266 » Path following algorithm for the graph matching problem |
134
click to vote
ICCAD
2008
IEEE
16 years 26 days ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
158
click to vote
NIPS
2007
15 years 5 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
137
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
146
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
134
click to vote
ADHOCNOW
2008
Springer
15 years 10 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...