Sciweavers

10054 search results - page 161 / 2011
» On the Complexity of Function Learning
Sort
View
TNN
2010
234views Management» more  TNN 2010»
14 years 7 months ago
Novel maximum-margin training algorithms for supervised neural networks
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
Oswaldo Ludwig, Urbano Nunes
99
Voted
FOCS
2007
IEEE
15 years 7 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
FOCS
2010
IEEE
14 years 10 months ago
The Monotone Complexity of k-clique on Random Graphs
It is widely suspected that Erdos-R
Benjamin Rossman
138
Voted
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
15 years 9 days ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
WEWORC
2007
148views Cryptology» more  WEWORC 2007»
15 years 1 months ago
Preimages for Reduced-Round Tiger
The cryptanalysis of the cryptographic hash function Tiger has, until now, focussed on finding collisions. In this paper we describe a preimage attack on the compression function ...
Sebastiaan Indesteege, Bart Preneel