2168 search results - page 8 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
ACL
2004
13 years 9 months ago
2004
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
ICS
2010
Tsinghua U.
14 years 13 days ago
2010
Tsinghua U.
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
FOCS
2003
IEEE
14 years 28 days ago
2003
IEEE
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...