2944 search results - page 491 / 589 » Improving Bound Propagation |
160
click to vote
ESA
2007
Springer
16 years 17 days ago
2007
Springer
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
152
click to vote
EUROCRYPT
2007
Springer
16 years 17 days ago
2007
Springer
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
167
click to vote
MIDDLEWARE
2007
Springer
16 years 16 days ago
2007
Springer
Distributed computations, dealing with large amounts of data, are scheduled in Grid clusters today using either a task-centric mechanism, or a worker-centric mechanism. Because of ...
190
click to vote
PAIRING
2007
Springer
16 years 15 days ago
2007
Springer
This paper puts forward new efficient constructions for public-key broadcast encryption that simultaneously enjoy the following properties: receivers are stateless; encryption is c...
207
click to vote
STACS
2007
Springer
16 years 15 days ago
2007
Springer
Fixed point equations x = f(x) over ω-continuous semirings can be seen as the mathematical foundation of interprocedural program analysis. The sequence 0, f(0), f2 (0), . . . conv...