Results 41 to 50 of about 447,111 (170)
Delay versus Stickiness Violation Trade-offs for Load Balancing in Large-Scale Data Centers
, 2017 Most load balancing techniques implemented in current data centers tend to rely on a mapping from packets to server IP addresses through a hash value calculated from the flow five-tuple.
Borst, Sem, Liang, Qingkai
core +1 more source
Lower bounds for union-split-find related problems on random access machines
Symposium on the Theory of Computing, 1994 We prove Ω(√log log n) lower bounds on the random access machine complexity of several dynamic, partially dynamic and static data structure problems, including the union-split-find problem, dynamic prefix problems and one-dimensional range query problems.
Peter Bro Miltersen
semanticscholar +1 more source
British Journal of Social Psychology, Volume 64, Issue 2, April 2025.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
The Case for Learned Index Structures
, 2018 Indexes are models: a B-Tree-Index can be seen as a model to map a key to the position of a record within a sorted array, a Hash-Index as a model to map a key to a position of a record within an unsorted array, and a BitMap-Index as a model to indicate ...
Abadi M. +12 more
core +1 more source
High-dimensional approximate nearest neighbor: k-d Generalized Randomized Forests [PDF]
, 2016 We propose a new data-structure, the generalized randomized kd forest, or kgeraf, for approximate nearest neighbor searching in high dimensions. In particular, we introduce new randomization techniques to specify a set of independently constructed trees ...
Avrithis, Yannis +2 more
core +1 more source
Reliable and randomized data distribution strategies for large scale storage systems
International Conference on High Performance Computing, 2011 The ever-growing amount of data requires highly scalable storage solutions. The most flexible approach is to use storage pools that can be expanded and scaled down by adding or removing storage devices.
Alberto Miranda +5 more
semanticscholar +1 more source
IoT and Man‐in‐the‐Middle Attacks
SECURITY AND PRIVACY, Volume 8, Issue 2, March/April 2025.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
Robust Dense Mapping for Large-Scale Dynamic Environments
, 2018 We present a stereo-based dense mapping algorithm for large-scale dynamic urban environments. In contrast to other existing methods, we simultaneously reconstruct the static background, the moving objects, and the potentially moving but currently ...
Bârsan, Ioan Andrei +3 more
core +1 more source
Random Slicing: Efficient and Scalable Data Placement for Large-Scale Storage Systems
TOS, 2014 The ever-growing amount of data requires highly scalable storage solutions. The most flexible approach is to use storage pools that can be expanded and scaled down by adding or removing storage devices.
Alberto Miranda +7 more
semanticscholar +1 more source
Journal of Applied Polymer Science, Volume 142, Issue 4, January 20, 2025.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