Sciweavers

315 search results - page 45 / 63
» Eigenvalue bounds for independent sets
Sort
View
IR
2008
13 years 9 months ago
Output-sensitive autocompletion search
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...
CORR
2007
Springer
95views Education» more  CORR 2007»
13 years 9 months ago
A Note on the Periodicity and the Output Rate of Bit Search Type Generators
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ç...
IPL
2002
93views more  IPL 2002»
13 years 9 months ago
Storing information with extractors
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 ...
Amnon Ta-Shma
EDBT
2011
ACM
231views Database» more  EDBT 2011»
13 years 1 months ago
Data integration with dependent sources
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...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
TIT
2011
134views more  TIT 2011»
13 years 4 months ago
Estimating Heavy-Tail Exponents Through Max Self-Similarity
: 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...
Stilian Stoev, George Michailidis, Murad S. Taqqu