Results 31 to 40 of about 65,579 (181)
Dynamic programming for graphs on surfaces [PDF]
, 2010 We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k.
B. Courcelle +15 more
core +1 more source
BMC Bioinformatics, 2017 Background RNA secondary structure prediction is a compute intensive task that lies at the core of several search algorithms in bioinformatics. Fortunately, the RNA folding approaches, such as the Nussinov base pair maximization, involve mathematical ...
Marek Palkowski, Wlodzimierz Bielecki
doaj +1 more source
Algorithmic Perception of Vertices in Sketched Drawings of Polyhedral Shapes [PDF]
, 2019 In this article, visual perception principles were used to build an artificial perception model aimed at developing an algorithm for detecting junctions in line drawings of polyhedral objects that are vectorized from hand-drawn sketches. The detection is
Company, Pedro +3 more
core +1 more source
A polyhedral approach to the generalized minimum labeling spanning tree problem
EURO Journal on Computational Optimization, 2019 The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple graph G, in which each edge has one label, by using a minimum number of labels.
ThiagoGouveiada Silva +4 more
doaj +1 more source
Minimal Bending Energies of Bilayer Polyhedra [PDF]
, 2010 Motivated by recent experiments on bilayer polyhedra composed of amphiphilic molecules, we study the elastic bending energies of bilayer vesicles forming polyhedral shapes.
Christoph A. Haselwandter +5 more
core +2 more sources
A Polyhedral Approach for Graph Coloring1
Electronic Notes in Discrete Mathematics, 2001 Abstract Abstract We present an approach based on an integer programming formulation of the graph coloring problem. Our goal is to develop a model that removes some symmetrical solutions obtained by color permutations. We study the problem from a polyhedral point of view and determine some families of facets of the associated polytope.
Isabel Méndez Díaz -, Paula Zabala
openaire +1 more source
MATEC Web of Conferences, 2018 The work represents a new approach of preliminary surface treatment of replaceable polyhedral cutting ceramics inserts for significant increase of adhesion strength with deposited wear-resistant nitride ceramics. By this method the hydrojet treatment was
Seleznev Anton +2 more
doaj +1 more source
Constrained Uncertain System Stabilization with Enlargement of Invariant Sets
Complexity, 2020 An enhanced method able to perform accurate stability of constrained uncertain systems is presented. The main objective of this method is to compute a sequence of feedback control laws which stabilizes the closed-loop system.
Walid Hamdi +2 more
doaj +1 more source
Aiding Dictionary Learning Through Multi-Parametric Sparse Representation
Algorithms, 2019 The ℓ 1 relaxations of the sparse and cosparse representation problems which appear in the dictionary learning procedure are usually solved repeatedly (varying only the parameter vector), thus making them well-suited to a multi-parametric ...
Florin Stoican, Paul Irofti
doaj +1 more source
Optimizing I/O for Big Array Analytics [PDF]
, 2012 Big array analytics is becoming indispensable in answering important scientific and business questions. Most analysis tasks consist of multiple steps, each making one or multiple passes over the arrays to be analyzed and generating intermediate results ...
Yang, Jun, Zhang, Yi
core +2 more sources