Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Bilardi, Gianfranco"'
Autor:
Bilardi, Gianfranco, Schimd, Michele
The edit distance is a metric of dissimilarity between strings, widely applied in computational biology, speech recognition, and machine learning. Let $e_k(n)$ denote the average edit distance between random, independent strings of $n$ characters fro
Externí odkaz:
http://arxiv.org/abs/2211.07644
We introduce the notion of an $r$-visit of a Directed Acyclic Graph DAG $G=(V,E)$, a sequence of the vertices of the DAG complying with a given rule $r$. A rule $r$ specifies for each vertex $v\in V$ a family of $r$-enabling sets of (immediate) prede
Externí odkaz:
http://arxiv.org/abs/2210.01897
Autor:
Tseng, Jessica, Bilardi, Gianfranco, Ekanadham, Kattamuri, Kumar, Manoj, Moreira, Jose, Pattnaik, P. C.
In this paper, we present a comprehensive architecture for confidential computing, which we show to be general purpose and quite efficient. It executes the application as is, without any added burden or discipline requirements from the application de
Externí odkaz:
http://arxiv.org/abs/2109.09821
Communication is a major factor determining the performance of algorithms on current computing systems; it is therefore valuable to provide tight lower bounds on the communication complexity of computations. This paper presents a lower bound techniqu
Externí odkaz:
http://arxiv.org/abs/1707.02229
A tight $\Omega((n/\sqrt{M})^{\log_2 7}M)$ lower bound is derived on the \io complexity of Strassen's algorithm to multiply two $n \times n$ matrices, in a two-level storage hierarchy with $M$ words of fast memory. A proof technique is introduced, wh
Externí odkaz:
http://arxiv.org/abs/1605.02224
Autor:
Bilardi, Gianfranco, Pietracaprina, Andrea, Pucci, Geppino, Scquizzato, Michele, Silvestri, Francesco
A framework is proposed for the design and analysis of \emph{network-oblivious algorithms}, namely, algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capab
Externí odkaz:
http://arxiv.org/abs/1404.3318
Publikováno v:
Theoretical Computer Science, Volume 514, 25 November 2013, Pages 36-60
The eviction problem for memory hierarchies is studied for the Hidden Markov Reference Model (HMRM) of the memory trace, showing how miss minimization can be naturally formulated in the optimal control setting. In addition to the traditional version
Externí odkaz:
http://arxiv.org/abs/1109.6643
Publikováno v:
In Theoretical Computer Science 25 November 2013 514:36-60
Autor:
BILARDI, GIANFRANCO1, EKANADHAM, KATTAMURI2 eknath@us.ibm.com, PATTNAIK, PRATAP2 ratap@us.ibm.com
Publikováno v:
Journal of the ACM. Aug2009, Vol. 56 Issue 5, p27-27:57. 57p. 10 Diagrams, 1 Chart, 1 Graph.