ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
: 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...
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
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...
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
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...
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
: 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...
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
: 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...
ICS
2010
Tsinghua U.
14 years 8 months ago
2010
Tsinghua U.
: 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...