Results 41 to 50 of about 206,500 (313)
10461 Abstracts Collection and Summary – Schematization in Cartography, Visualization, and Computational Geometry [PDF]
, 2011 The Dagstuhl Seminar 10461 ``Schematization in Cartography, Visualization, and Computational Geometry'' was held November 14--19, 2010 in Schloss Dagstuhl~-- Leibniz Center for Informatics.
Wolff, Alexander +2 more
core +1 more source
Discrete Mathematics & Theoretical Computer ScienceNot every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the
Patrizio Angelini +10 more
doaj +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Optimal Algorithm for the Planar Two-Center Problem [PDF]
TheoretiCSWe study a fundamental problem in Computational Geometry, the planar two-center problem. In this problem, the input is a set $S$ of $n$ points in the plane and the goal is to find two smallest congruent disks whose union contains all points of $S$.
Kyungjin Cho +3 more
doaj +1 more source
Realistic Analysis for Algorithmic Problems on Geographical Data [PDF]
, 2013 The worst-case analysis is a key element of the performance analysis of algorithms. When it comes to spatial data, such as paths of moving objects and digital terrain models, the theoretical worst case may be a contrived configuration which would never ...
Sub Computational Geometry +2 more
core
Segmentation of Trajectories on Nonmonotone Criteria [PDF]
, 2015 In the trajectory segmentation problem, we are given a polygonal trajectory with n vertices that we have to subdivide into a minimum number of disjoint segments (subtrajectories) that all satisfy a given criterion.
Staals, F. +11 more
core +1 more source
FEBS Letters, EarlyView.The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson +6 more
wiley +1 more source
Implicit coupled Hilfer–Hadamard fractional differential systems under weak topologies
Advances in Difference Equations, 2018 In this article, we present some existence of weak solutions for a coupled system of implicit fractional differential equations of Hilfer–Hadamard type. Our approach is based on Mönch’s fixed point theorem associated with the technique of measure of weak
Saïd Abbas +3 more
doaj +1 more source
The geometry of quantum computation
Quantum Information and Computation, 2008 Whether the class Quantum Merlin Arthur is equal to QMA_1, or QMA with one-sided error, has been an open problem for years. This note helps to explain why the problem is difficult, by using ideas from real analysis to give a quantum oracle relative to which QMA\neqQMA_1. As a byproduct, we find that there are facts about quantum complexity classes that
Dowling, Mark R., Nielsen, Michael A.
openaire +4 more sources
On Measures for Groups of Trajectories [PDF]
, 2017 We present a list of measures for a single trajectory, including measures that require the presence of other trajectories, such as the centrality of a trajectory amidst other trajectories.
Sub Computational Geometry +8 more
core +1 more source