Results 21 to 30 of about 76,024 (266)
Pushing aggregate constraints by divide-and-approximate [PDF]
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone constraints into iceberg-cube mining. However, many useful constraints are not anti-monotone.
Wang, Ke +4 more
openaire +3 more sources
Constrained spectral clustering via multi–layer graph embeddings on a grassmann manifold
We present two algorithms in which constrained spectral clustering is implemented as unconstrained spectral clustering on a multi-layer graph where constraints are represented as graph layers.
Trokicić Aleksandar +1 more
doaj +1 more source
Structural optimization aims to achieve a structural design that provides the best performance while satisfying the given design constraints. When uncertainties in design and conditions are taken into account, reliability-based design optimization (RBDO)
Junho Chun
doaj +1 more source
Connected bin packing problem on traceable graphs [PDF]
We consider a new extension of the bin packing problem in which a set of connectivity constraints should be satisfied. An undirected graph with a weight function on the nodes is given.
A. Nejoomi, A. Dolati
doaj +1 more source
The single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints is considered. There are some fixed jobs which are already fixed in the schedule.
YANGAi-feng(杨爱峰) +1 more
doaj +1 more source
In this article, aiming at the longitudinal dynamics model of air-breathing hypersonic vehicles, a fuzzy-approximation-based prescribed performance control scheme with input constraints is proposed.
Xingge Li +3 more
doaj +1 more source
To improve the visual quality of noisy medical images acquired by low radiation dose imaging, medical image denoising is highly desirable for clinical disease diagnosis.
Linlin Ji, Qiang Guo, Mingli Zhang
doaj +1 more source
Approximation with interpolatory constraints [PDF]
Given a triangular array of points on [ − 1 , 1 ] [-1,1] satisfying certain minimal separation conditions, a classical theorem of Szabados asserts the existence of polynomial operators that provide interpolation at these points as well as a near-optimal degree of approximation for arbitrary ...
Mhaskar, H. N. +3 more
openaire +2 more sources
𝐿¹-approximation with constraints [PDF]
In this paper we study problems of best L 1 {L^1}
Allan Pinkus, Hans Strauss
openaire +1 more source
Diophantine approximation with constraints
Following Schmidt, Thurnheer and Bugeaud-Kristensen, we study how Dirichlet's theorem on linear forms needs to be modified when one requires that the vectors of coefficients of the linear forms make a bounded acute angle with respect to a fixed proper non-zero subspace $V$ of $\mathbb{R}^n$.
Champagne, Jérémy, Roy, Damien
openaire +2 more sources

