Results 41 to 50 of about 9,951 (116)
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs
Let $G$ be a graph where each vertex is associated with a label. A Vertex-Labeled Approximate Distance Oracle is a data structure that, given a vertex $v$ and a label $\lambda$, returns a $(1+\varepsilon)$-approximation of the distance from $v$ to the ...
BT Wilkinson+9 more
core +1 more source
Abstract The military is widely regarded as an extension and tool of government and society, and unreliable military behaviour during operations can have far‐reaching strategic and political consequences. Historically, literature has focused on the role of leaders in preventing disaster, emphasizing their traits, styles and attributes.
Sally Knox+2 more
wiley +1 more source
Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search
The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution $\mathcal{H}$ over locality-sensitive hash functions ...
A Andoni+12 more
core +1 more source
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of type "Is x in A?" can be answered very quickly.
Romashchenko, Andrei
core +3 more sources
IoT and Man‐in‐the‐Middle Attacks
ABSTRACT This article provides an overview of the Internet of things (IoT) and its growing significance in today's interconnected world. It discusses the concept of man‐in‐the‐middle (MitM) attacks in detail, including their various types, causes, and potential impacts on IoT networks.
Hamidreza Fereidouni+2 more
wiley +1 more source
Sprinklers: A Randomized Variable-Size Striping Approach to Reordering-Free Load-Balanced Switching [PDF]
Internet traffic continues to grow exponentially, calling for switches that can scale well in both size and speed. While load-balanced switches can achieve such scalability, they suffer from a fundamental packet reordering problem.
Dai, Jim+4 more
core
Overview of the experimental approach and the key data gathered using ultra small‐angle x‐ray scattering. High‐resolution scattering patterns are collected as the beam passes through the stretched silica‐filled rubber compounds. Data from scattering patterns gives insights into the hierarchical structure of the silica filler and deformation‐induced ...
Ilya Yakovlev+6 more
wiley +1 more source
The parahydrogen‐derived 13C hyperpolarization can be generated with high field polarization transfer sequences. We attempt to circumvent the need for a dedicated polarizer by using the MRI system to produce the substrate. We study the experimental conditions imposed by the MRI setup and mitigate these effects via simulations and experiments and reach ...
Henri de Maissin+7 more
wiley +1 more source
Dynamic Ordered Sets with Exponential Search Trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structures.
Andersson, Arne, Thorup, Mikkel
core +3 more sources
Governing the Algorithmic City
Philosophy &Public Affairs, Volume 53, Issue 2, Page 102-168, Spring 2025.
Seth Lazar
wiley +1 more source