نتایج جستجو برای: bloom filter

تعداد نتایج: 130787  

2011
Pragyan Acharya Sudhansu Sekhar Singh

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging while locating mobile users. Reduction of communication overhead has become a burning issue of today. It induces the intellects to innovate some means which are cost reducing by nature. Location management aims to reduce this overhead through predicti...

2015
Rolf Egert Marc Fischlin David Gens Sven Jacob Matthias Senker Jörn Tillmanns

In this paper we propose a new approach to privately compute the set-union cardinality and the set-intersection cardinality among multiple honest-but-curious parties. Our approach is inspired by a proposal of Ashok and Mukkamala (DBSec’14) which deploys Bloom filters to approximate the size tightly. One advantage of their solution is that it avoids ample public-key cryptography. Unfortunately, ...

2014
Elias Szabo-Wexler

The task of representing a set so as to support membership queries is a common one in computer science. If space is no object, a complete dictionary may provide accurate QUERYing in good runtime. If space is at a premium and the size of the set uncertain, Bloom filters and hash compaction provide good approximations. If the size is completely unknown, a modified Bloom filter provides very good ...

2008
David Talbot John M. Talbot

We consider the problem of succinctly encoding a static map to support approximate queries. We derive upper and lower bounds on the space requirements in terms of the error rate and the entropy of the distribution of values over keys: our bounds differ by a factor log e. For the upper bound we introduce a novel data structure, the Bloom map, generalising the Bloom filter to this problem. The lo...

2017

This paper aims at exploring the characteristics and skills required of mental Health human services workers. An analysis of the vital skills will be presented and the fundamental characteristics such as having a caring heart, patience, compassionate, and driven with the desire to see all people gain the best out of their lives. This is because the success of our lives is driven with having a s...

2017

This paper aims at exploring the characteristics and skills required of mental Health human services workers. An analysis of the vital skills will be presented and the fundamental characteristics such as having a caring heart, patience, compassionate, and driven with the desire to see all people gain the best out of their lives. This is because the success of our lives is driven with having a s...

Journal: :Random Struct. Algorithms 2006
Adam Kirsch Michael Mitzenmacher

A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstrate that this technique can be usefully applied to Bloom filters and related data structures. Specifically, only two hash functions are necessary to effectively implement a Bloom filter without any loss in the asymptot...

2006
Xun Duan Jian-shi Li

Bloom filters are used for resource routing and distance-weighted Bloom filters (dwBFs) are used as a concise representation of routing information for scattered resources in overlay networks. Today's DHT-based P2P lookups are always influenced by unnecessarily long routers in the underlay network. The reason is that the false positives appearing in DHT lookup can lead to incorrect direction. T...

Journal: :I. J. Network Security 2017
Devi Thiyagarajan R. Ganesan

Resources such as storage and network as a service to organizations and customers in reduced cost by cloud computing. The documents stored in cloud are of huge size and due to its sensitivity arises security and storage problems. Data is stored on remote location in cloud and cryptographic techniques resolve problems of data security. To ensure data to be secure in cloud, the client encrypts da...

Journal: :Computer Networks 2011
Rafael P. Laufer Pedro B. Velloso Otto Carlos Muniz Bandeira Duarte

Distributed applications use Bloom filters to transmit large sets in a compact form. However, attackers can easily disrupt these applications by using or advertising saturated filters. In this paper we introduce the Generalized Bloom Filter (GBF), a space-efficient data structure to securely represent a set in distributed applications, such as IP traceback, web caching, and peer-to-peer network...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید