Sciweavers

759 search results - page 54 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
15 years 10 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
JGAA
2000
179views more  JGAA 2000»
14 years 9 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
EMMCVPR
2009
Springer
15 years 4 months ago
Multi-label Moves for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
Olga Veksler
IBERAMIA
2010
Springer
14 years 8 months ago
Interaction Graphs for Multivariate Binary Data
We define a class of graphs that summarize in a compact visual way the interaction structure between binary multivariate characteristics. This allows studying the conditional depe...
Johan Van Horentonioeek, Jesús Emeterio Nav...
CEC
2008
IEEE
15 years 4 months ago
Path optimization for multiple objectives in directed graphs using genetic algorithms
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
Juan Rada, Ruben Parma, Wilmer Pereira