Sciweavers

10054 search results - page 173 / 2011
» On the Complexity of Function Learning
Sort
View
EUROCRYPT
2005
Springer
15 years 8 months ago
Cryptanalysis of the Hash Functions MD4 and RIPEMD
MD4 is a hash function developed by Rivest in 1990. It serves as the basis for most of the dedicated hash functions such as MD5, SHAx, RIPEMD, and HAVAL. In 1996, Dobbertin showed ...
Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, ...
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
15 years 7 months ago
Controlling overfitting with multi-objective support vector machines
Recently, evolutionary computation has been successfully integrated into statistical learning methods. A Support Vector Machine (SVM) using evolution strategies for its optimizati...
Ingo Mierswa
ICALP
2007
Springer
15 years 9 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...
ATAL
2008
Springer
15 years 5 months ago
Graph Laplacian based transfer learning in reinforcement learning
The aim of transfer learning is to accelerate learning in related domains. In reinforcement learning, many different features such as a value function and a policy can be transfer...
Yi-Ting Tsao, Ke-Ting Xiao, Von-Wun Soo
ISAAC
2005
Springer
138views Algorithms» more  ISAAC 2005»
15 years 8 months ago
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
Zhixiang Chen, Bin Fu