Sciweavers

10054 search results - page 328 / 2011
» On the Complexity of Function Learning
Sort
View
CAL
2002
15 years 3 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally
IJON
2002
82views more  IJON 2002»
15 years 3 months ago
Functional imaging and neuronal information processing
Since the functional magnetic resonance imaging (fMRI) signal is likely to re ect a spatial average of the activity of neurons with partly dissimilar response properties, its inte...
Angel Nevado, Malcolm P. Young, Stefano Panzeri
181
Voted
FSE
2011
Springer
218views Cryptology» more  FSE 2011»
14 years 7 months ago
Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
In this paper, we present new results on the second-round SHA-3 candidate ECHO. We describe a method to construct a collision in the compression function of ECHO-256 reduced to fou...
Jérémy Jean, Pierre-Alain Fouque
274
Voted
ACL
1998
15 years 5 months ago
Maximum Entropy Model Learning of the Translation Rules
This paper proposes a learning method of translation rules from parallel corpora. This method applies the maximum entropy principle to a probabilistic model of translation rules. ...
Kengo Sato, Masakazu Nakanishi
100
Voted
TNN
2008
82views more  TNN 2008»
15 years 3 months ago
Deterministic Learning for Maximum-Likelihood Estimation Through Neural Networks
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
Cristiano Cervellera, Danilo Macciò, Marco ...