13784 search results - page 2547 / 2757 » On Computing Functions with Uncertainty |
COCO
2005
Springer
14 years 2 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
EDO
2005
Springer
14 years 2 months ago
2005
Springer
This paper addresses the issues of test coverage analysis of J2EE servers. These middleware are nowadays at the core of the modern information technology’s landscape. They provi...
EUROCRYPT
2005
Springer
14 years 2 months ago
2005
Springer
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
ICMI
2005
Springer
14 years 2 months ago
2005
Springer
To overcome the limitations of current technologies for remote collaboration, we propose a system that changes a video feed based on task properties, people’s actions, and messa...
ICS
2005
Tsinghua U.
14 years 2 months ago
2005
Tsinghua U.
Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to eve...