Sciweavers

9405 search results - page 469 / 1881
» Computing a Model of Set Theory
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 7 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
JMLR
2012
13 years 10 months ago
Sparse Additive Machine
We develop a high dimensional nonparametric classification method named sparse additive machine (SAM), which can be viewed as a functional version of support vector machine (SVM)...
Tuo Zhao, Han Liu
STOC
2003
ACM
174views Algorithms» more  STOC 2003»
16 years 8 months ago
Adiabatic quantum state generation and statistical zero knowledge
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
Dorit Aharonov, Amnon Ta-Shma
PODC
2005
ACM
16 years 1 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CORR
2006
Springer
81views Education» more  CORR 2006»
15 years 7 months ago
The Workshop on Internet Topology (WIT) Report
Internet topology analysis has recently experienced a surge of interest in computer science, physics, and the mathematical sciences. However, researchers from these different disc...
Dmitri V. Krioukov, Fan R. K. Chung, Kimberly C. C...