Sciweavers

730 search results - page 78 / 146
» Combinatorics of Monotone Computations
Sort
View
JEA
2010
94views more  JEA 2010»
13 years 2 months ago
Layer-free upward crossing minimization
An upward drawing of a DAG G is a drawing of G in which all edges are drawn as curves increasing monotonically in the vertical direction. In this paper, we present a new approach f...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...
ACL
2011
12 years 11 months ago
A Class of Submodular Functions for Document Summarization
We design a class of submodular functions meant for document summarization tasks. These functions each combine two terms, one which encourages the summary to be representative of ...
Hui Lin, Jeff Bilmes
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 1 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
CPM
2005
Springer
97views Combinatorics» more  CPM 2005»
14 years 1 months ago
On the Complexity of Sparse Exon Assembly
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
ECCV
2010
Springer
14 years 22 days ago
Detecting Faint Curved Edges in Noisy Images
A fundamental question for edge detection is how faint an edge can be and still be detected. In this paper we offer a formalism to study this question and subsequently introduce a...