|
|
|
|
|
Ashwin Jacob, Diptapriyo Majumdar and Venkatesh Raman
In parameterized complexity, it is well-known that a parameterized problem is fixed-parameter tractable if and only if it has a kernel?an instance equivalent to the input instance, whose size is just a function of the parameter. The size of the kernel ca...
ver más
|
|
|
|
|
|
|
|
|
Ketan Dalal, Luc Devroye and Ebrahim Malalla
Linear probing continues to be one of the best practical hashing algorithms due to its good average performance, efficiency, and simplicity of implementation. However, the worst-case performance of linear probing seems to degrade with high load factors d...
ver más
|
|
|
|
|
|
|
|
|
Katerina Karelina
Pág. 28 - 35
The mapping was introduced in one of the works devoted to the study of correlation-immune functions. This mapping allows to quickly increase the number of function's variables. It is the base of recursive method of synthesis correlation-immune Bool...
ver más
|
|
|
|
|
|
|
|
|
Zin Win Thu, Dasom Kim, Junseok Lee, Woon-Jae Won, Hyeon Jun Lee, Nan Lao Ywet, Aye Aye Maw and Jae-Woo Lee
In this paper, we introduce a new formulation of the multivehicle point-to-point network problem to be utilised in urban air mobility (UAM) vertiport-to-vertiport network operations. Vehicle routing problems (VRPs) and their variants have previously been...
ver más
|
|
|
|
|
|
|
|
|
Joseph Pedersen, Rafael Muñoz-Gómez, Jiangnan Huang, Haozhe Sun, Wei-Wei Tu and Isabelle Guyon
We address the problem of defending predictive models, such as machine learning classifiers (Defender models), against membership inference attacks, in both the black-box and white-box setting, when the trainer and the trained model are publicly released...
ver más
|
|
|
|