Zobrazeno 1 - 10
of 128
pro vyhledávání: '"Viola, Alfredo"'
The widespread use of machine learning and data-driven algorithms for decision making has been steadily increasing over many years. The areas in which this is happening are diverse: healthcare, employment, finance, education, the legal system to name
Externí odkaz:
http://arxiv.org/abs/2405.12312
In this paper we consider the closest vector problem (CVP) for lattices $\Lambda \subseteq \mathbb{Z}^n$ given by a generator matrix $A\in \mathcal{M}_{n\times n}(\mathbb{Z})$. Let $b>0$ be the maximum of the absolute values of the entries of the mat
Externí odkaz:
http://arxiv.org/abs/2304.03616
Autor:
Pépin, Martin, Viola, Alfredo
Directed acyclic graphs (DAGs) are directed graphs in which there is no path from a vertex to itself. DAGs are an omnipresent data structure in computer science and the problem of counting the DAGs of given number of vertices and to sample them unifo
Externí odkaz:
http://arxiv.org/abs/2303.14710
In this paper we focus on concurrent processes built on synchronization by means of futures. This concept is an abstraction for processes based on a main execution thread but allowing to delay some computations. The structure of a general concurrent
Externí odkaz:
http://arxiv.org/abs/1803.00843
The Continued Logarithm Algorithm - CL for short- introduced by Gosper in 1978 computes the gcd of two integers; it seems very efficient, as it only performs shifts and subtractions. Shallit has studied its worst-case complexity in 2016 and showed it
Externí odkaz:
http://arxiv.org/abs/1801.10139
Autor:
Poblete, Patricio V., Viola, Alfredo
Thirty years ago, the Robin Hood collision resolution strategy was introduced for open addressing hash tables, and a recurrence equation was found for the distribution of its search cost. Although this recurrence could not be solved analytically, it
Externí odkaz:
http://arxiv.org/abs/1605.04031
Publikováno v:
In Procedia Computer Science 2021 195:468-477
Autor:
Janson, Svante, Viola, Alfredo
We give a unified analysis of linear probing hashing with a general bucket size. We use both a combinatorial approach, giving exact formulas for generating functions, and a probabilistic approach, giving simple derivations of asymptotic results. Both
Externí odkaz:
http://arxiv.org/abs/1410.5967
Optimal prefix codes are studied for pairs of independent, integer-valued symbols emitted by a source with a geometric probability distribution of parameter $q$, $0{<}q{<}1$. By encoding pairs of symbols, it is possible to reduce the redundancy penal
Externí odkaz:
http://arxiv.org/abs/1102.2413
Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields
Publikováno v:
SIAM Journal on Discrete Mathematics 27 (2013) 855-891
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible ones (irred
Externí odkaz:
http://arxiv.org/abs/0912.3312