2520 search results - page 356 / 504 » The complexity of approximating entropy |
130
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
124
Voted
FSE
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean f...
171
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
152
click to vote
SENSYS
2003
ACM
15 years 9 months ago
2003
ACM
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
148
click to vote
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...