2218 search results - page 378 / 444 » Testing Expressibility Is Hard |
ALT
2006
Springer
14 years 6 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
SOSP
2003
ACM
14 years 6 months ago
2003
ACM
Numerous systems have been designed which use virtualization to subdivide the ample resources of a modern computer. Some require specialized hardware, or cannot support commodity ...
SOSP
2003
ACM
14 years 6 months ago
2003
ACM
Despite decades of research in extensible operating system technology, extensions such as device drivers remain a significant cause of system failures. In Windows XP, for example,...
SOSP
2009
ACM
14 years 6 months ago
2009
ACM
Bugs in kernel extensions remain one of the main causes of poor operating system reliability despite proposed techniques that isolate extensions in separate protection domains to ...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...