Results 31 to 40 of about 13,736,700 (344)
Efficient algorithms for dualizing large-scale hypergraphs [PDF]
Discrete Applied Mathematics, 2011 A hypergraph F is a set family defined on vertex set V. The dual of F is the set of minimal subsets H of V such that F ∩ H ≠ p for any F ∈ F. The computation of the dual is equivalent to many problems, such as minimal hitting set enumeration of a subset ...
Keisuke Murakami, T. Uno
semanticscholar +1 more source
The “PRO-N” clitic en/ne and the theory of cliticization [PDF]
Bucharest Working Papers in Linguistics, 2017 The Romance pro-N clitic (Fr., Cat.) en / (It.) ne is problematic for most theories of cliticization, because some phenomena support a movement analysis, while others seem to speak against movement.
Ion Giurgea
doaj
SIEVES AND THE MINIMAL RAMIFICATION PROBLEM [PDF]
Journal of the Institute of Mathematics of Jussieu, 2018 The minimal ramification problem may be considered as a quantitative version of the inverse Galois problem. For a nontrivial finite group $G$, let $m(G)$ be the minimal integer $m$ for which there exists a $G$-Galois extension $N/\mathbb{Q}$ that is ramified at exactly $m$ primes (including the infinite one).
Bary-Soroker, Lior, Schlank, Tomer M.
openaire +2 more sources
A lower bound on the order of the largest induced forest in planar graphs with high girth
, 2015 We give here new upper bounds on the size of a smallest feedback vertex set in planar graphs with high girth. In particular, we prove that a planar graph with girth $g$ and size $m$ has a feedback vertex set of size at most $\frac{4m}{3g}$, improving the
Dross, François +2 more
core +2 more sources
Cascade of minimizers for a nonlocal isoperimetric problem in thin domains
, 2014 For $\Omega_\e=(0,\e)\times (0,1)$ a thin rectangle, we consider minimization of the two-dimensional nonlocal isoperimetric problem given by \[ \inf_u E^{\gamma}_{\Omega_\e}(u)\] where \[ E^{\gamma}_{\Omega_\e}(u):= P_{\Omega_\e}(\{u(x)=1\})+\gamma\int_{\
Morini, Massimiliano, Sternberg, Peter
core +1 more source
Minimal Controllability Problems [PDF]
IEEE Transactions on Control of Network Systems, 2014 Given a linear system, we consider the problem of finding a small set of variables to affect with an input so that the resulting system is controllable. We show that this problem is NP-hard; indeed, we show that even approximating the minimum number of variables that need to be affected within a multiplicative factor of $c \log n$ is NP-hard for some ...
openaire +2 more sources
Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma
Molecular Oncology, EarlyView.The causes of central nervous system (CNS) hemangioblastoma in Von Hippel–Lindau (vHL) disease are unclear. We used Whole Exome Sequencing (WES) on familial hemangioblastoma to investigate events that underlie tumor development. Our findings suggest that VHL loss creates a permissive environment for tumor formation, while additional alterations ...
Maja Dembic +5 more
wiley +1 more source
FEBS Open Bio, EarlyView.Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
A second order minimality condition for the Mumford-Shah functional
, 2007 A new necessary minimality condition for the Mumford-Shah functional is derived by means of second order variations. It is expressed in terms of a sign condition for a nonlocal quadratic form on $H^1_0(\Gamma)$, $\Gamma$ being a submanifold of the ...
A. Bonnet +14 more
core +1 more source
Energy Minimizing Vehicle Routing Problem [PDF]
, 2007 This paper proposes a new cost function based on distance and load of the vehicle for the Capacitated Vehicle Routing Problem. The vehicle-routing problem with this new load-based cost objective is called the Energy Minimizing Vehicle Routing Problem (EMVRP).
Kara, İ., Kara, Bahar Y., Yetiş, M. K.
openaire +2 more sources