Sciweavers

672 search results - page 11 / 135
» Almost Optimal Dispersers
Sort
View
FOCI
2007
IEEE
14 years 4 months ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe
CRYPTO
2000
Springer
277views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
Jürgen Bierbrauer, Holger Schellwat
CP
2010
Springer
13 years 8 months ago
Load Balancing and Almost Symmetries for RAMBO Quorum Hosting
Abstract. Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where t...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
AAAI
2010
13 years 11 months ago
Voting Almost Maximizes Social Welfare Despite Limited Communication
In cooperative multiagent systems an alternative that maximizes the social welfare--the sum of utilities--can only be selected if each agent reports its full utility function. Thi...
Ioannis Caragiannis, Ariel D. Procaccia
CORR
2011
Springer
273views Education» more  CORR 2011»
13 years 4 months ago
Natural Language Processing (almost) from Scratch
We propose a unified neural network architecture and learning algorithm that can be applied to various natural language processing tasks including: part-of-speech tagging, chunki...
Ronan Collobert, Jason Weston, Léon Bottou,...