Sciweavers

DAM
2008
111views more  DAM 2008»
13 years 11 months ago
Sums of squares based approximation algorithms for MAX-SAT
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...
Hans van Maaren, Linda van Norden, M. J. H. Heule
DAM
2008
92views more  DAM 2008»
13 years 11 months ago
Convex drawings of graphs with non-convex boundary constraints
: 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 ...
Seok-Hee Hong, Hiroshi Nagamochi
DAM
2008
67views more  DAM 2008»
13 years 11 months ago
Rotation symmetric Boolean functions - Count and cryptographic properties
Pantelimon Stanica, Subhamoy Maitra
DAM
2008
110views more  DAM 2008»
13 years 11 months ago
Counting and enumerating aggregate classifiers
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...
Jan Adem, Yves Crama, Willy Gochet, Frits C. R. Sp...
DAM
2008
75views more  DAM 2008»
13 years 11 months ago
Patterns of simple gene assembly in ciliates
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...
Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz ...
DAM
2008
117views more  DAM 2008»
13 years 11 months ago
Analysis on the strip-based projection model for discrete tomography
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...
Jiehua Zhu, Xiezhang Li, Yangbo Ye, Ge Wang
DAM
2008
72views more  DAM 2008»
13 years 11 months ago
On the existence of maximal elements: An impossibility theorem
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...
Nikolai S. Kukushkin
DAM
2008
129views more  DAM 2008»
13 years 11 months ago
Minimum cost homomorphisms to semicomplete multipartite digraphs
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...
Gregory Gutin, Arash Rafiey, Anders Yeo
DAM
2008
108views more  DAM 2008»
13 years 11 months ago
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
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...
Cédric Bentz
DAM
2008
67views more  DAM 2008»
13 years 11 months ago
Remembering Leo Khachiyan
Vasek Chvátal