Results 51 to 60 of about 94,016 (314)
International Journal of Approximate Reasoning, 2009 AbstractWe show how to learn a deep graphical model of the word-count vectors obtained from a large set of documents. The values of the latent variables in the deepest layer are easy to infer and give a much better representation of each document than Latent Semantic Analysis.
Ruslan Salakhutdinov, Geoffrey E. Hinton
openaire +2 more sources
Deep Discrete Hashing with Self-supervised Pairwise Labels
, 2017 Hashing methods have been widely used for applications of large-scale image retrieval and classification. Non-deep hashing methods using handcrafted features have been significantly outperformed by deep hashing methods due to their better feature ...
A Andoni +12 more
core +1 more source
load thresholds for cuckoo hashing with double hashing [PDF]
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018 In k-ary cuckoo hashing, each of cn objects is associated with k random buckets in a hash table of size n. An l-orientation is an assignment of objects to associated buckets such that each bucket receives at most l objects. Several works have determined load thresholds c^* = c^*(k,l) for k-ary cuckoo hashing; that is, for c c^* no l-orientation ...
Mitzenmacher, Michael +2 more
openaire +3 more sources
Algorithmica, 2010 The hash table, especially its external memory version, is one of the most important index structures in large databases. Assuming a truly random hash function, it is known that in a standard external hash table with block size b, searching for a particular key only takes expected average t_q=1+1/2Ω(b) disk accesses for any load factor α bounded away ...
Pagh, Rasmus +3 more
openaire +6 more sources
Designing Physical Unclonable Functions From Optically Active Materials
Advanced Materials, EarlyView.Assigning unforgeable “fingerprints” to manufactured goods is a key strategy to fight global counterfeiting. Optical physical unclonable functions (PUFs) are chemically generated random patterns of optically active materials serving as unique authenticators.
Maxime Klausen +2 more
wiley +1 more source
Synonym‐based multi‐keyword ranked search with secure k‐NN in 6G network
IET Networks, EarlyView., 2022 Abstract Sixth Generation (6G) integrates the next generation communication systems such as maritime, terrestrial, and aerial to offer robust network and massive device connectivity with ultra‐low latency requirement. The cutting edge technologies such as artificial intelligence, quantum machine learning, and millimetre enable hyper‐connectivity to ...
Deebak Bakkiam David, Fadi Al‐Turjman
wiley +1 more source
HASHING ALGORITHM BASED ON TWO-DIMENSIONAL CHAOTIC MAPPINGS
Системный анализ и прикладная информатика, 2017 A new hashing algorithm based on dynamic chaos is proposed. Owing to the use of chaotic mappings, this algorithm is irreversible and a search for two messages with identical hash-values becomes computationally difficult.
A. V. Sidorenko, I. V. Shakinko
doaj +1 more source
Blockchain Technology in Advertising Campaigns
Цифровая трансформация, 2023 The article is devoted to the peculiarities of blockchain technology in terms of its application in the economy. The emphasis is on the impact of this technology on the advertising market.
A. A. Efremov +2 more
doaj +1 more source
Ranking-based Deep Cross-modal Hashing
, 2019 Cross-modal hashing has been receiving increasing interests for its low storage cost and fast query speed in multi-modal data retrievals. However, most existing hashing methods are based on hand-crafted or raw level features of objects, which may not be ...
Domeniconi, Carlotta +5 more
core +1 more source
A Standalone FPGA-based Miner for Lyra2REv2 Cryptocurrencies
, 2020 Lyra2REv2 is a hashing algorithm that consists of a chain of individual hashing algorithms, and it is used as a proof-of-work function in several cryptocurrencies.
Balatsoukas-Stimming, Alexios +4 more
core +2 more sources