2638 search results - page 51 / 528 » Random Geometric Complexes |
IJON
2008
15 years 2 months ago
2008
Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Trans. Neural Networks 17(4) (2006) 879
112
Voted
JOLLI
1998
15 years 2 months ago
1998
This paper shows how proof nets can be used to formalize the notion of “incomplete dependency” used in psycholinguistic theories of the unacceptability of center-embedded const...
103
Voted
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...
123
Voted
AAAI
2008
15 years 4 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
126
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...