Results 41 to 50 of about 118,403 (212)
Simple, compact and robust approximate string dictionary [PDF]
, 2014 This paper is concerned with practical implementations of approximate string dictionaries that allow edit errors. In this problem, we have as input a dictionary $D$ of $d$ strings of total length $n$ over an alphabet of size $\sigma$.
Belazzougui, Djamal, Chegrane, Ibrahim
core +1 more source
Parallel Evaluation of Multi-join Queries [PDF]
, 1995 A number of execution strategies for parallel evaluation of multi-join queries have been proposed in the literature. In this paper we give a comparative performance evaluation of four execution strategies by implementing all of them on the same parallel ...
America R +17 more
core +9 more sources
Parallel Recursive State Compression for Free [PDF]
, 2011 This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a tree-based multi-core compression method, which works by leveraging sharing among sub-vectors ...
A. Laarman +14 more
core +6 more sources
A Simulated Annealing Algorithm to Construct Covering Perfect Hash Families
Mathematical Problems in Engineering, 2018 Covering perfect hash families (CPHFs) are combinatorial designs that represent certain covering arrays in a compact way. In previous works, CPHFs have been constructed using backtracking, tabu search, and greedy algorithms.
J. Torres-Jiménez +1 more
semanticscholar +1 more source
Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications [PDF]
, 2019 In this paper we identify a new class of sparse near-quadratic random Boolean matrices that have full row rank over F_2 = {0,1} with high probability and can be transformed into echelon form in almost linear time by a simple version of Gauss elimination.
Dietzfelbinger, Martin, Walzer, Stefan
core +3 more sources
Ability of stabilizer quantum error correction to protect itself from its own imperfection [PDF]
, 2014 The theory of stabilizer quantum error correction allows us to actively stabilize quantum states and simulate ideal quantum operations in a noisy environment.
Fujiwara, Yuichiro
core +2 more sources
Recursive n-gram hashing is pairwise independent, at best [PDF]
, 2010 Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values.
Carter +12 more
core +2 more sources
Advanced Science, EarlyView.This paper presents a programmable metasurface‐based Meta Key Distribution (MKD) system for secure, protocol‐independent key exchange in indoor wireless settings. By embedding entropy into the wireless channel, it enables lightweight, compatible cryptographic key generation.
Xinyu Li +7 more
wiley +1 more source
К проблеме хеш-адресации без коллизий постоянного массива ключей [PDF]
, 2007 In article the problem of designing of the perfect hash-addressing for a constant set of keys is investigated. The algorithm of designing of the perfect hash-addressing as hierarchical system of Boolean functions is developed.
Кузнецов, А. А. +1 more
core
Human Resource Management, EarlyView.ABSTRACT Frontline service workers are crucial to service delivery and have been a long‐standing focus of research, with scholars and practitioners alike maintaining an interest in their effective management. As technology increasingly transforms this context, the way in which managers in service organizations communicate with frontline workers has ...
Alexandra Budjanovcanin, Wei‐Ning Yang
wiley +1 more source