344 search results - page 55 / 69 » Some Theorems We Should Prove |
COMBINATORICS
2000
13 years 7 months ago
2000
We study the limiting distribution of the height in a generalized trie in which external nodes are capable to store up to b items (the so called b-tries). We assume that such a tr...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
CCS
2007
ACM
13 years 11 months ago
2007
ACM
We examine covert channels in privacy-enhanced mobile identification devices where the devices uniquely identify themselves to an authorized verifier. Such devices (e.g. RFID tags)...
EUROPAR
2005
Springer
14 years 26 days ago
2005
Springer
Ibis1 is a programming environment for the development of grid applications in Java. We aim to support a wide range of applications and parallel platforms, so our example programs ...
AAAI
2012
11 years 9 months ago
2012
In recent times, crowdsourcing over social networks has emerged as an active tool for complex task execution. In this paper, we address the problem faced by a planner to incentivi...