2354 search results - page 409 / 471 » Randomness, Stochasticity and Approximations |
159
click to vote
ASIACRYPT
2009
Springer
16 years 9 days ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
156
click to vote
CIKM
2009
Springer
16 years 9 days ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
164
click to vote
COCOON
2009
Springer
16 years 9 days ago
2009
Springer
The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing ap...
173
click to vote
ESA
2009
Springer
16 years 8 days ago
2009
Springer
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
159
click to vote
ISNN
2009
Springer
16 years 8 days ago
2009
Springer
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...