We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
Adoption of an information system could be reflected in two ways: through the adoption intentions of the non-adopters and the extent of adoption for the adopters. This study seeks...
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
The advent of the smartphone as a highly complex technology has been accompanied by mobile operating systems (OS), large communities of developers, diverse content providers, and ...
As Facebook has become global, users from different cultural and socio-political contexts have joined the site. We present a case study investigating how both current and historic...