Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Fuentes Sepúlveda, José"'
Edge computing enables data processing and storage closer to where the data are created. Given the largely distributed compute environment and the significantly dispersed data distribution, there are increasing demands of data sharing and collaborati
Externí odkaz:
http://arxiv.org/abs/2306.01074
We show that any embedding of a planar graph can be encoded succinctly while efficiently answering a number of topological queries near-optimally. More precisely, we build on a succinct representation that encodes an embedding of $m$ edges within $4m
Externí odkaz:
http://arxiv.org/abs/1911.09498
Autor:
Fuentes-Sepúlveda, José, Ladra, Susana
Publikováno v:
IEEE Access 7, pp. 155625-155636 (2019)
In the field of algorithms and data structures analysis and design, most of the researchers focus only on the space/time trade-off, and little attention has been paid to energy consumption. Moreover, most of the efforts in the field of Green Computin
Externí odkaz:
http://arxiv.org/abs/1911.09370
Publikováno v:
In Information and Computation June 2023 292
Publikováno v:
In Computational Geometry: Theory and Applications February 2023 109
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Given a string of length $n$ that is composed of $r$ runs of letters from the alphabet $\{0,1,\ldots,\sigma{-}1\}$ such that $2 \le \sigma \le r$, we describe a data structure that, provided $r \le n / \log^{\omega(1)} n$, stores the string in $r\log
Externí odkaz:
http://arxiv.org/abs/1711.02910
The sheer sizes of modern datasets are forcing data-structure designers to consider seriously both parallel construction and compactness. To achieve those goals we need to design a parallel algorithm with good scalability and with low memory consumpt
Externí odkaz:
http://arxiv.org/abs/1705.00415
Publikováno v:
Knowl Inf Syst (2016)
The wavelet tree has become a very useful data structure to efficiently represent and query large volumes of data in many different domains, from bioinformatics to geographic information systems. One problem with wavelet trees is their construction t
Externí odkaz:
http://arxiv.org/abs/1610.05994