DAM
2008
13 years 5 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
DAM
2008
13 years 5 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
DAM
2008
13 years 5 months ago
2008
DAM
2008
13 years 5 months ago
2008
We propose a generic model for the "weighted voting" aggregation step performed by several methods in supervised classification. Further, we construct an algorithm to en...
DAM
2008
13 years 5 months ago
2008
The intramolecular model for gene assembly in ciliates considers three operations, ld, hi, and dlad that can assemble any gene pattern through folding and recombination: the molec...
DAM
2008
13 years 5 months ago
2008
Discrete tomography deals with image reconstruction of an object with finitely many gray levels (such as two). Different approaches are used to model the raw detector reading. The...
DAM
2008
13 years 5 months ago
2008
All sufficient (as well as necessary) conditions for a binary relation on a metric space to admit a maximal element on every nonempty compact subset of its domain that have been f...
DAM
2008
13 years 5 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
DAM
2008
13 years 5 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
DAM
2008
13 years 5 months ago
2008
