3228 search results - page 260 / 646 » Computationally Sound Proofs |
125
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
180
click to vote
PLDI
2011
ACM
14 years 7 months ago
2011
ACM
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Re...
123
click to vote
UC
2009
Springer
15 years 11 months ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
137
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
123
click to vote
EUROPAR
2005
Springer
15 years 10 months ago
2005
Springer
The process of scheduling computations for Internet-based computing presents challenges not encountered with more traditional platforms for parallel and distributed computing. The...