English
Related papers

Related papers: A note on linear fractional set packing problem

200 papers

This paper concerns a method of selecting a subset of features for a sequential logit model. Tanaka and Nakagawa (2014) proposed a mixed integer quadratic optimization formulation for solving the problem based on a quadratic approximation…

Methodology · Statistics 2015-10-20 Toshiki Sato , Yuichi Takano , Ryuhei Miyashiro

These lecture notes endeavour to collect in one place the mathematical background required to understand the properties of kernels in general and the Random Fourier Features approximation of Rahimi and Recht (NIPS 2007) in particular. We…

Machine Learning · Computer Science 2020-05-05 Amitabha Bagchi

A crucial challenge to the scaling up of linear optical interferometers is the presence of defective optical components resulting from inevitable imperfections in fabrication and packaging. This work presents a method for circumventing such…

Quantum Physics · Physics 2019-12-19 Ish Dhand

Bitangential interpolation problems in the class of matrix valued functions in the generalized Schur class are considered in both the open unit disc and the open right half plane, including problems in which the solutions is not assumed to…

Classical Analysis and ODEs · Mathematics 2011-02-22 Vladimir Derkach , Harry Dym

Random Fourier Features (RFF) is among the most popular and broadly applicable approaches for scaling up kernel methods. In essence, RFF allows the user to avoid costly computations on a large kernel matrix via a fast randomized…

Machine Learning · Statistics 2023-02-23 Junwen Yao , N. Benjamin Erichson , Miles E. Lopes

We provide new formulas for the coefficients in the partial fraction decomposition of the restricted partition generating function. These techniques allow us to partially resolve a recent conjecture of Sills and Zeilberger. We also describe…

Number Theory · Mathematics 2014-01-14 Cormac O'Sullivan

When solving partial differential equations on scattered nodes using the Radial Basis Function-generated Finite Difference (RBF-FD) method, one of the parameters that must be chosen is the stencil size. Focusing on Polyharmonic Spline RBFs…

Numerical Analysis · Mathematics 2026-02-26 Andrej Kolar-Požun , Mitja Jančič , Miha Rot , Gregor Kosec

A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over…

Combinatorics · Mathematics 2021-09-22 Jonathan Jedwab , Shuxing Li

A brief comment on A variational Bayesian approach for inverse problems with skew-t error distributions (Guha et al., Journal of Computational Physics 301 (2015) 377-393) is given in this letter.

Methodology · Statistics 2016-11-24 Javier E. Contreras-Reyes , Freddy Omar López Quintero

In [S. Arumugam, V. Mathew and J. Shen, On fractional metric dimension of graphs, preprint], Arumugam et al. studied the fractional metric dimension of the cartesian product of two graphs, and proposed four open problems. In this paper, we…

Combinatorics · Mathematics 2014-05-27 Min Feng , Benjian Lv , Kaishun Wang

The paper elucidates, with an analytic example, a subtle mistake in the application of the extended likelihood method to the problem of determining the fractions of pure samples in a mixed sample from the shape of the distribution of a…

Data Analysis, Statistics and Probability · Physics 2010-11-11 A. Nappi

In a recent paper, Saxena et al. [1] developed the solutions of three generalized fractional kinetic equations in terms of Mittag-Leffler functions. The object of the present paper is to further derive the solution of further generalized…

Mathematical Physics · Physics 2009-11-10 R. K. Saxena , A. M. Mathai , H. J. Haubold

Mass transport problems are ubiquitous in diverse fields of physics and engineering. With the development of fractional calculus, many have taken to studying problems of fractional mass transport either through numerical simulations or…

Mathematical Physics · Physics 2025-06-18 Nathaniel G. Hermann , M. Shane Hutson

During the last few years several new results on packing problems were obtained using a blend of tools from semidefinite optimization, polynomial optimization, and harmonic analysis. We survey some of these results and the techniques…

Optimization and Control · Mathematics 2016-02-10 Fernando Mário de Oliveira Filho , Frank Vallentin

A new formalism is presented for finding equilibrium distribution functions for axisymmetric systems. The formalism, obtainded by using the concept of fractional derivatives, generalizes the methods of Fricke (1952), Kalnajs (1972) and…

Astrophysics · Physics 2009-06-14 Juan F. Pedraza , Javier Ramos-Caro , Guillermo A. Gonzalez

Many procedures for SAT and SAT-related problems -- in particular for those requiring the complete enumeration of satisfying truth assignments -- rely their efficiency on the detection of partial assignments satisfying an input formula. In…

Logic in Computer Science · Computer Science 2020-03-10 Roberto Sebastiani

We consider several extensions of the fractional bin packing problem, a relaxation of the traditional bin packing problem where the objects may be split across multiple bins. In these extensions, we introduce load-balancing constraints…

Data Structures and Algorithms · Computer Science 2018-10-30 Davi Castro-Silva , Eric Gourdin

We proceed here with our systematic study, initiated in [3], of multiscale problems with defects, within the context of homogenization theory. The case under consideration here is that of a diffusion equation with a diffusion coefficient of…

Analysis of PDEs · Mathematics 2019-01-29 Xavier Blanc , Marc Josien , Claude Le Bris

A gap in the proof of Theorem 3.5 in the paper ``A new iteration process for approximation of common fixed points for finite families of total asymtotically nonexpansive mappings". Int. J. Math. Math. Sci. vol. 2009,…

Functional Analysis · Mathematics 2012-04-10 C. E. Chidume , E. U. Ofoedu

We consider online fractional covering problems with a convex objective, where the covering constraints arrive over time. Formally, we want to solve $\min\,\{f(x) \mid Ax\ge \mathbf{1},\, x\ge 0\},$ where the objective function…

Data Structures and Algorithms · Computer Science 2014-12-30 Niv Buchbinder , Shahar Chen , Anupam Gupta , Viswanath Nagarajan , Joseph , Naor