Results 51 to 60 of about 983,384 (170)

Low-power bloom filter architecture for deep packet inspection [PDF]

, 2006
Bloom filters are frequently used to identify malicious content like viruses in high speed networks. However, architectures proposed to implement bloom filters are not power efficient.
Kocak, Taskin, Kaya, Ilhan, Kocak, T, Kaya, I   +3 more
core   +1 more source

Separating hash families with large universe

Journal of Combinatorial Theory, Series A
Separating hash families are useful combinatorial structures which generalize several well-studied objects in cryptography and coding theory. Let $p_t(N, q)$ denote the maximum size of universe for a $t$-perfect hash family of length $N$ over an alphabet of size $q$. In this paper, we show that $q^{2-o(1)}
Xin Wei, Xiande Zhang, Gennian Ge
openaire   +4 more sources

Universal hashing with weakly biased arrays [PDF]

, 2013
Представлено решение задачи построения строго универсального хеширования по алгебраическим кривым и слабо смещенным массивам.Представлено рішення задачі побудови строго універсального гешування за алгебричними кривими та слабо зміщеними масивами.The ...
Г.З. Халимов, G.Z. Khalimov, Г.З. Халімов   +2 more
core  

Performance comparison of point and spatial access methods [PDF]

, 1990
In the past few years a large number of multidimensional point access methods, also called multiattribute index structures, has been suggested, all of them claiming good performance.
Kriegel, Hans-Peter, Hartmanis, J., Ralf Schneider, Michael Schiwietz, Bernhard Seeger, Schiwietz, M., Hans-Peter Kriegel, Schneider, Ralf, Seeger, B., Goos, G.   +9 more
core   +1 more source

Se agrava problema de sequía en Chihuahua

, 2012
No ...
El Universal
core  

Construction of universal one-way hash functions: Tree hashing revisited

Discrete Applied Mathematics, 2007
AbstractWe present a binary tree based parallel algorithm for extending the domain of a universal one-way hash function (UOWHF). For t⩾2, our algorithm extends the domain from the set of all n-bit strings to the set of all ((2t-1)(n-m)+m)-bit strings, where m is the length of the message digest. The associated increase in key length is 2m bits for t=2;
openaire   +2 more sources

Universal health plan proposal

, 2022
Title from PDF caption (viewed on September 14, 2022)."The Joint Task Force on Universal Care began with the passing of Senate Bill 770. The task is to design a universal health plan that would be equitable, affordable, and comprehensive. This plan would

core  

Latent Semantic Minimal Hashing for Image Retrieval

, 2017
Hashing-based similarity search is an important technique for large-scale query-by-example image retrieval system, since it provides fast search with computation and memory efficiency.
Lu, Xiaoqiang, Zheng, Xiangtao, Li, Xuelong   +2 more
core   +1 more source

Abstracts

Molecular Oncology, Volume 20, Issue S1, Page 1-692, August 2026.
Abstracts submitted to the ‘EACR 2026 Congress: Innovative Cancer Science’, from 08–11 June 2026 and accepted by the Congress Organising Committee are published in this Supplement of Molecular Oncology, an affiliated journal of the European Association for Cancer Research (EACR).
wiley   +1 more source

Collision resistance evaluation of universal hashing on the algebraic curves [PDF]

, 2013
Представлены оценки коллизионной стойкости универсального хеширования по наилучшим алгебраическим кривым с большим числом точек и максимальным кривым.Представлені оцінки колізійної стійкості універсального гешування за найкращими алгебричними кривими з ...
Г.З. Халимов, G.Z. Khalimov, Г.З. Халімов   +2 more
core