We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
Holger Bast, Christian Worm Mortensen, Ingmar Webe...
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two ...
Yucel Altug, N. Polat Ayerden, Mehmet Kivanç...
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
: In this paper, a novel approach to the problem of estimating the heavy–tail exponent α > 0 of a distribution is proposed. It is based on the fact that block–maxima of siz...