321 search results - page 37 / 65 » Randomness extractors -- applications and constructions |
230
click to vote
CTRSA
2012
Springer
14 years 2 months ago
2012
Springer
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
191
click to vote
ICEIS
2009
IEEE
16 years 1 months ago
2009
IEEE
Proposed and developed is a service composition framework for decision-making under uncertainty, which is applicable to stochastic optimization of supply chains. Also developed is ...
169
click to vote
FAW
2009
Springer
16 years 1 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
157
click to vote
COLT
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
164
click to vote
APPROX
2005
Springer
16 years 4 days ago
2005
Springer
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...