5084 search results - page 909 / 1017 » Proving Possibility Properties |
206
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
227
click to vote
CTRSA
2011
Springer
14 years 10 months ago
2011
Springer
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
311
click to vote
FOSSACS
2011
Springer
14 years 10 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
197
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
179
click to vote
JSAC
2011
14 years 9 months ago
2011
—We consider a communication channel with two transmitters and one receiver, with an underlying rate region which is approximated as a general pentagon. Different from the Gaussi...