Zobrazeno 1 - 10
of 161
pro vyhledávání: '"Gianfranco Bilardi"'
Autor:
Gianfranco Bilardi, Michele Schimd
Publikováno v:
String Processing and Information Retrieval ISBN: 9783030326852
SPIRE
SPIRE
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3077f927ea331a192e528e754077ddaa
http://arxiv.org/abs/2211.07644
http://arxiv.org/abs/2211.07644
Publikováno v:
Proceedings of the ACM on Programming Languages. 3:1-28
We present a novel approach to context-free grammar parsing that is based on generating a sequence of grammars called derivative grammars from a given context-free grammar and input string. The generation of the derivative grammars is described by a
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 article presents a lower bound techni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2e29b654c509a3feab45fbcb329063f
http://arxiv.org/abs/1707.02229
http://arxiv.org/abs/1707.02229
Publikováno v:
Conf. Computing Frontiers
The replacement policies known as MIN and OPT are optimal for a two-level memory hierarchy. The computation of the cache content for these policies requires the off-line knowledge of the entire address trace. However, the stack distance of a given ac
Autor:
Gianfranco Bilardi, Lorenzo De Stefani
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319621265
WADS
WADS
A tight \(\varOmega ((n/\sqrt{M})^{\log _2 7}M)\) lower bound is derived on the I/O 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 intro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7247c64931a6cccc33f312c298421dcd
https://doi.org/10.1007/978-3-319-62127-2_16
https://doi.org/10.1007/978-3-319-62127-2_16
Publikováno v:
International Journal of Parallel Programming. 41:430-468
The Linear-Scan algorithm (1970), applicable to priority replacement policies, computes stack distances and the number of misses incurred on a given address trace, for all cache sizes, in time O(V) per access. Here, V is the number of distinct (virtu
Autor:
Augusto Ferrante, Gianfranco Bilardi
Publikováno v:
Linear Algebra and its Applications. 425(2-3):323-344
The optimal control problem for time-invariant linear systems with quadratic cost is considered for arbitrary, i.e., non-necessarily positive semidefinite, terminal cost matrices. A classification of such matrices is proposed, based on the maximum ho
Autor:
Gianfranco Bilardi, Keshav Pingali
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662466629
CC
CC
In the compiler literature, parsing algorithms for context-free grammars are presented using string rewriting systems or abstract machines such as pushdown automata. Unfortunately, the resulting descriptions can be baroque, and even a basic understan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62f3a4de6d8395da3f4f490f0d0f42fc
https://doi.org/10.1007/978-3-662-46663-6_1
https://doi.org/10.1007/978-3-662-46663-6_1
Publikováno v:
IPDPS Workshops
We investigate the issue of stalling in the LogP model. In particular, we introduce a novel quantitative characterization of stalling, referred to as @d-stalling, which intuitively captures the realistic assumption that once the network's capacity co