Sciweavers

1450 search results - page 236 / 290
» On the Complexity of Hardness Amplification
Sort
View
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 4 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
OOPSLA
2007
Springer
14 years 4 months ago
Living in the comfort zone
A comfort zone is a tested region of a system’s input space within which it has been observed to behave acceptably. To keep systems operating within their comfort zones, we advo...
Martin C. Rinard
OOPSLA
2007
Springer
14 years 4 months ago
Scalable omniscient debugging
Omniscient debuggers make it possible to navigate backwards in time within a program execution trace, drastically improving the task of debugging complex applications. Still, they...
Guillaume Pothier, Éric Tanter, José...
OOPSLA
2007
Springer
14 years 4 months ago
The design and implementation of formal monitoring techniques
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
Eric Bodden
FOCS
2006
IEEE
14 years 4 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...