Zobrazeno 1 - 10
of 324
pro vyhledávání: '"68P05"'
Autor:
Benrazek, Ala-Eddine, Kouahla, Zineddine, Farou, Brahim, Seridi, Hamid, Kemouguette, Ibtissem
The proliferation of interconnected devices in the Internet of Things (IoT) has led to an exponential increase in data, commonly known as Big IoT Data. Efficient retrieval of this heterogeneous data demands a robust indexing mechanism for effective o
Externí odkaz:
http://arxiv.org/abs/2408.16036
Autor:
Eslami, Navid, Dayan, Niv
Range filters are probabilistic data structures that answer approximate range emptiness queries. They aid in avoiding processing empty range queries and have use cases in many application domains such as key-value stores and social web analytics. How
Externí odkaz:
http://arxiv.org/abs/2408.05625
Autor:
Wolf, Marc, Wolf, François
Modulo a prime number, we define semi-primitive roots as the square of primitive roots. We present a method for calculating primitive roots from quadratic residues, including semi-primitive roots. We then present progressions that generate primitive
Externí odkaz:
http://arxiv.org/abs/2407.20269
Autor:
Gauthier, Renaud
We highlight the presence of a ground state in the $\infty$-categorical Grothendieck construction of Lurie, further developed by Arakawa, in which both straightened and unstraightened pictures coexist.
Comment: 25 pages
Comment: 25 pages
Externí odkaz:
http://arxiv.org/abs/2405.17135
The height of a random PATRICIA tree built from independent, identically distributed infinite binary strings with arbitrary diffuse probability distribution $\mu$ on $\{0,1\}^\mathbb{N}$ is studied. We show that the expected height grows asymptotical
Externí odkaz:
http://arxiv.org/abs/2403.05269
Autor:
Lo, Jason
We build on the theory of ontology logs (ologs) created by Spivak and Kent, and define a notion of wiring diagrams. In this article, a wiring diagram is a finite directed labelled graph. The labels correspond to types in an olog; they can also be int
Externí odkaz:
http://arxiv.org/abs/2402.01020
What is a time-varying graph, or a time-varying topological space and more generally what does it mean for a mathematical structure to vary over time? Here we introduce categories of narratives: powerful tools for studying temporal graphs and other t
Externí odkaz:
http://arxiv.org/abs/2402.00206
Quantum computing is finding promising applications in optimization, machine learning and physics, leading to the development of various models for representing quantum information. Because these representations are often studied in different context
Externí odkaz:
http://arxiv.org/abs/2401.01322
Autor:
Wolf, Marc, Wolf, François
We present a method for finding large fixed-size primes of the form $X^2+c$. We study the density of primes on the sets $E_c = \{N(X,c)=X^2+c,\ X \in (2\mathbb{Z}+(c-1))\}$, $c \in \mathbb{N}^*$. We describe an algorithm for generating values of $c$
Externí odkaz:
http://arxiv.org/abs/2311.05647
We spot a hole in the area of succinct data structures for graph classes from a universe of size at most $n^n$. Very often, the input graph is labeled by the user in an arbitrary and easy-to-use way, and the data structure for the graph relabels the
Externí odkaz:
http://arxiv.org/abs/2311.02839