Sciweavers

ICS
2010
Tsinghua U.
14 years 2 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
ICS
2010
Tsinghua U.
14 years 2 months ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
ICS
2010
Tsinghua U.
14 years 2 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
ICS
2010
Tsinghua U.
14 years 2 months ago
Space-Efficient Estimation of Robust Statistics and Distribution Testing
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
Steve Chien, Katrina Ligett, Andrew McGregor
ICS
2010
Tsinghua U.
14 years 2 months ago
Cryptographic Complexity Classes and Computational Intractability Assumptions
Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek
ICS
2010
Tsinghua U.
14 years 2 months ago
Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
Maria-Florina Balcan, Avrim Blum, Yishay Mansour
ICS
2010
Tsinghua U.
14 years 2 months ago
Reaching Consensus on Social Networks
Abstract: Research in sociology studies the effectiveness of social networks in achieving computational tasks. Typically the agents who are supposed to achieve a task are unaware o...
Elchanan Mossel, Grant Schoenebeck
ICS
2010
Tsinghua U.
14 years 2 months ago
Robustness of the Learning with Errors Assumption
: Starting with the work of Ishai-Sahai-Wagner and Micali-Reyzin, a new goal has been set within the theory of cryptography community, to design cryptographic primitives that are s...
Shafi Goldwasser, Yael Kalai, Chris Peikert, Vinod...
ICS
2010
Tsinghua U.
14 years 2 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns