1162 search results - page 30 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
133
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
137
click to vote
ICCV
2007
IEEE
15 years 10 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
191
click to vote
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
134
click to vote
ICCAD
2001
IEEE
16 years 20 days ago
2001
IEEE
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
126
Voted
MICS
2010
14 years 10 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...