Sciweavers

1090 search results - page 45 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
NAACL
2007
13 years 11 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 10 months ago
Problem Solving and Complex Systems
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
Frédéric Guinand, Yoann Pigné
ICCV
2007
IEEE
15 years 8 days ago
Introducing Curvature into Globally Optimal Image Segmentation: Minimum Ratio Cycles on Product Graphs
While the majority of competitive image segmentation methods are based on energy minimization, only few allow to efficiently determine globally optimal solutions. A graphtheoretic...
Thomas Schoenemann, Daniel Cremers
ICS
1993
Tsinghua U.
14 years 2 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
TAMC
2009
Springer
14 years 4 months ago
Approximation and Hardness Results for Label Cut and Related Problems
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
Peng Zhang, Jin-yi Cai, Linqing Tang, Wenbo Zhao