Results 1 to 10 of about 1,414,908 (321)
Two Combinatorial Algorithms for the Constrained Assignment Problem with Bounds and Penalties
In the paper, we consider a generalization of the classical assignment problem, which is called the constrained assignment problem with bounds and penalties (CA-BP).
Guojun Hu, Junran Lichen, Pengxiang Pan
doaj +1 more source
An Improved Nordhaus–Gaddum-Type Theorem for 2-Rainbow Independent Domination Number
For a graph G, its k-rainbow independent domination number, written as γrik(G), is defined as the cardinality of a minimum set consisting of k vertex-disjoint independent sets V1,V2,…,Vk such that every vertex in V0=V(G)\(∪i=1kVi) has a neighbor in Vi ...
Enqiang Zhu
doaj +1 more source
GE vs GM: Efficient side-channel security evaluations on full cryptographic keys
Security evaluations for full cryptographic keys is a very important research topic since the past decade. An efficient rank estimation algorithm was proposed at FSE 2015 to approximate the empirical guessing entropy remaining after a side-channel ...
Anca Rădulescu +2 more
doaj +3 more sources
Blockwise and Low Density Key Error Correcting Codes [PDF]
To protect the information from disturbances created by noisy channels, redundant symbols (called check symbols) with the information symbols are added. These extra symbols play important role for the efficiency of the communication system.
Pankaj Kumar Das, Subodh Kumar
doaj +1 more source
Minimizing Error Bounds in Lacunary Interpolation by Spline (0, 2) Case [PDF]
In this paper, we have changed the boundary conditions and the class of spline functions which are given by (Varma, (1973) from first derivative to third derivative, and show that the change of the boundary conditions and the class of spline functions ...
Karwan H. Jwamer Faridun Kader Hama Salih
doaj +1 more source
Inequalities for unified integral operators of generalized refined convex functions
In this article, the bounds of unified integral operators are studied by using a new notion called refined (α,h−m)−p-convex function. The upper and lower bounds in the form of Hadamard inequality are established.
Moquddsa Zahra +3 more
doaj +1 more source
Generalization Bounds via Information Density and Conditional Information Density [PDF]
We present a general approach, based on an exponential inequality, to derive bounds on the generalization error of randomized learning algorithms. Using this approach, we provide bounds on the average generalization error as well as bounds on its tail ...
Durisi, Giuseppe, Hellström, Fredrik
core +2 more sources
In this paper, we derive lower and upper bounds on the OPTA of a two-user multi-input multi-output (MIMO) causal encoding and causal decoding problem.
Photios A. Stavrou +2 more
doaj +1 more source
New Bounds for the Modified Bessel Function of the First Kind and Toader-Qi Mean
Let Ipx be the modified Bessel function of the first kind of order p. The upper and lower bounds in the form of simple rational functions about cosht and (sinht)/t for the function I0x are obtained.
Ling Zhu
doaj +1 more source
In this article, we establish bounds of sum of the left and right sided Riemann Liouville (RL) fractional integrals and related inequalities in general form.
Ghulam Farid +4 more
doaj +1 more source

