5606 search results - page 337 / 1122 » Randomization Techniques for Graphs. |
150
click to vote
FSTTCS
1992
Springer
15 years 10 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
164
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
180
click to vote
MVA
1990
15 years 7 months ago
1990
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...
227
click to vote
TSMC
2011
15 years 1 months ago
2011
— Consider a scenario in which the data owner has some private/sensitive data and wants a data miner to access it for studying important patterns without revealing the sensitive ...
167
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...