1450 search results - page 236 / 290 » On the Complexity of Hardness Amplification |
168
click to vote
ISSAC
2007
Springer
16 years 29 days ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
178
click to vote
OOPSLA
2007
Springer
16 years 28 days ago
2007
Springer
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...
206
click to vote
OOPSLA
2007
Springer
16 years 28 days ago
2007
Springer
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...
203
click to vote
OOPSLA
2007
Springer
16 years 28 days ago
2007
Springer
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...
174
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
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...