Results 11 to 20 of about 1,709,161 (224)
Linear tabling strategies and optimizations [PDF]
Theory and Practice of Logic Programming, 2008 Abstract Recently there has been a growing interest in research in tabling in the logic programming community because of its usefulness in a variety of application domains including program analysis, parsing, deductive databases, theorem proving, model checking, and logic-based probabilistic learning.
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
openaire +2 more sources
A Linear View on Shape Optimization
SIAM Journal on Control and Optimization, 2023 Shapes do not define a linear space. This paper explores the linear structure of deformations as a representation of shapes. This transforms shape optimization to a variant of optimal control. The numerical challenges of this point of view are highlighted and a novel linear version of the second shape derivative is proposed leading to particular ...
Stephan Schmidt 0003, Volker H. Schulz
openaire +3 more sources
Classical linear vector optimization duality revisited
, 2010 With this note we bring again into attention a vector dual problem neglected by the contributions who have recently announced the successful healing of the trouble encountered by the classical duals to the classical linear vector optimization problem ...
Bot, Radu Ioan +2 more
core +1 more source
Optimizing Implementations of Linear Layers
IACR Transactions on Symmetric Cryptology, 2020 In this paper, we propose a new heuristic algorithm to search efficient implementations (in terms of Xor count) of linear layers used in symmetric-key cryptography. It is observed that the implementation cost of an invertible matrix is related to its matrix decomposition if sequential-Xor (s-Xor) metric is considered, thus reducing the implementation ...
Zejun Xiang 0001 +4 more
openaire +6 more sources
Proceedings of the 6th International Conference on Pattern Recognition Applications and Methods, 2017 Often in real-world datasets, especially in high dimensional data, some feature values are missing. Since most data analysis and statistical methods do not handle gracefully missing values, the first step in the analysis requires the imputation of missing values.
Yehezkel S. Resheff, Daphna Weinshall
openaire +2 more sources
Optimizing Linear Extensions [PDF]
SIAM Journal on Discrete Mathematics, 2009 The minimum number of elements needed for a poset to have exactly n linear extensions is at most 2sqrt{n}. In a special case, the bound can be improved to sqrt{n}.
openaire +2 more sources
The Discrete Dantzig Selector: Estimating Sparse Linear Models via Mixed Integer Linear Optimization
, 2017 We propose a novel high-dimensional linear regression estimator: the Discrete Dantzig Selector, which minimizes the number of nonzero regression coefficients subject to a budget on the maximal absolute correlation between the features and residuals ...
Mazumder, Rahul, Radchenko, Peter
core +1 more source
Separable Concave Optimization Approximately Equals Piecewise-Linear Optimization [PDF]
, 2012 We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1+epsilon by a piecewise-linear minimization problem over the same feasible set. Our main result is
Magnanti, Thomas L., Stratila, Dan
core +1 more source
, 2009 A generic algorithm is developed to reduce the problem of obtaining linear and nonlinear entanglement witnesses of a given quantum system, to convex optimization problem.
Bailey R A +19 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Blinatumomab has been shown to be highly effective for patients with pediatric B‐ALL and has recently become standard of care therapy. Due to its past use in the clinical trial setting, there is limited information available about real‐world administration.
Katelyn Oranges +12 more
wiley +1 more source