Výsledky vyhľadávania - 68W40: Analysis of algorithms

(Re)packing Equal Disks into Rectangle Autor Fomin, Fedor V., Golovach, Petr A., Inamdar, Tanmay, Saurabh, Saket, Zehavi, Meirav

“…The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a…”
Získať plný text

Provably Unforgeable Threshold EdDSA with an Offline Participant and Trustless Setup Autor Battagliola, Michele, Longo, Riccardo, Meneghetti, Alessio, Sala, Massimiliano

“…We present an EdDSA-compatible multi-party digital signature scheme that supports an offline participant during the key-generation phase, without relying on a…”
Získať plný text

Threshold ECDSA with an Offline Recovery Party Autor Battagliola, Michele, Longo, Riccardo, Meneghetti, Alessio, Sala, Massimiliano

“…: the key-generation and signature algorithms are replaced by a communication protocol between the players, but the verification algorithm remains identical to that of a signature issued using the centralized algorithm…”
Získať plný text

Searchable encryption with randomized ciphertext and randomized keyword search Autor Calderini, Marco, Longo, Riccardo, Sala, Massimiliano, Villa, Irene

“…The notion of public-key encryption with keyword search (PEKS) was introduced to search over encrypted data without performing any decryption. In this article,…”
Získať plný text

An adaptive congestion control algorithm Autor Gupta, Ajay Kumar, Singh, Devendra, Singh, Karan, Verma, Lal Pratap

“…The congestion of the network increases exponentially due to continuous growth of the Internet. TCP is a protocol of Transport layer which deals with the…”
Získať plný text

Optimal online k-min search Autor Iqbal, Javeria, Ahmad, Iftikhar

“…≤T and k>T (T being the total number of time points/days). We perform a competitive analysis of the proposed Hybrid algorithm, and compare it with the min-search strategy by conducting experiments on real-world data…”
Získať plný text

A competitive algorithm for throughput maximization on identical machines Autor Moseley, Benjamin, Pruhs, Kirk, Stein, Clifford, Zhou, Rudy

“… The main result is an O (1) competitive deterministic algorithm for any number of machines m > 1 …”
Získať plný text

Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization Autor Curtis, Frank E., O’Neill, Michael J., Robinson, Daniel P.

“…) algorithm that has been designed for solving optimization problems involving a stochastic objective function and deterministic nonlinear equality constraints…”
Získať plný text

Stabilization and variations to the adaptive local iterative filtering algorithm: the fast resampled iterative filtering method Autor Barbarino, Giovanni, Cicone, Antonio

“…Non-stationary signals are ubiquitous in real life. Many techniques have been proposed in the last decades which allow decomposing multi-component signals into…”
Získať plný text

Spectrally Constrained Optimization Autor Garner, Casey, Lerman, Gilad, Zhang, Shuzhong

“… Two first-order algorithms are developed to obtain first-order stationary points for general non-convex objective functions…”
Získať plný text

Diverse collections in matroids and graphs Autor Fomin, Fedor V., Golovach, Petr A., Panolan, Fahad, Philip, Geevarghese, Saurabh, Saket

“…We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems. The input to the Weighted Diverse…”
Získať plný text

High-Accuracy Numerical Methods and Convergence Analysis for Schrödinger Equation with Incommensurate Potentials Autor Jiang, Kai, Li, Shifeng, Zhang, Juan

“… The corresponding convergence analysis is also presented and shows that the proposed methods both have spectral convergence rates in space and second order accuracy in time, respectively…”
Získať plný text

Theoretical analysis of GOMP based on RIP and ROC Autor Li, Haifeng, Guo, Leiyan

“…This paper aims to investigate sufficient conditions for the recovery of sparse signals via the generalized orthogonal matching pursuit (gOMP) algorithm…”
Získať plný text

Euclidean TSP in Narrow Strips Autor Alkema, Henk, de Berg, Mark, van der Hofstad, Remco, Kisfaludi-Bak, Sándor

“… (which can be computed in O ( n log 2 n ) time using an existing algorithm) is guaranteed to be a shortest tour overall when δ…”
Získať plný text

Multi-UAV Aerial Mission Intelligent Assignment Algorithm Based on LightGBM Model Autor Wang, Yongcheng, Zhang, Guohui

“… the intelligent assignment of multiple UAVs without increasing time cost compared to the classical algorithm through comparative analysis…”
Získať plný text

Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship Autor Caragiannis, Ioannis, Filos-Ratsikas, Aris, Frederiksen, Søren Kristoffer Stiil, Hansen, Kristoffer Arnsfelt, Tan, Zihan

“…We study the truthful facility assignment problem, where a set of agents with private most-preferred points on a metric space have to be assigned to facilities…”
Získať plný text

A note on limits of sequences of binary trees Autor Grübel, Rudolf

“… and its structure as a metric space. For random trees the subtree size topology arises in the context of algorithms for searching and sorting when applied to random input, resulting in a sequence of nested trees…”
Získať plný text

Smoothed performance guarantees for local search Autor Brunsch, Tobias, Röglin, Heiko, Rutten, Cyriel, Vredeveld, Tjark

“… To find out how robust these bounds are, we study the algorithms in the framework of smoothed analysis, in which instances are subject to some degree of random noise…”
Získať plný text

On a leader election algorithm: Truncated geometric case study Autor Kalpathy, Ravi, Ward, Mark Daniel

“…Recent work of Kalpathy and Mahmoud (in press) gives very general results for a broad class of fair leader election algorithms…”
Získať plný text

Covering dimension of finite topological spaces Autor Wang, Kaiyun, Wang, Huixin, Yang, Xiaofei

“… Moreover, we give a new algorithm to compute the covering dimension of a finite T 0 space by finding minimal elements under the specialization order…”
Získať plný text