1162 search results - page 134 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
ICIP
2007
IEEE
14 years 2 months ago
2007
IEEE
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...
CNSM
2010
13 years 3 months ago
2010
Network control and management techniques (e.g., dynamic path switching, on-demand bandwidth provisioning) rely on active measurements of end-to-end network status. These measureme...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
WSC
2008
13 years 10 months ago
2008
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...