Sciweavers

9209 search results - page 381 / 1842
» Data Space Randomization
Sort
View
TARK
2009
Springer
16 years 1 months ago
Foundations of non-commutative probability theory
Kolmogorov’s setting for probability theory is given an original generalization to account for probabilities arising from Quantum Mechanics. The sample space has a central role ...
Daniel Lehmann
CORR
2004
Springer
140views Education» more  CORR 2004»
15 years 6 months ago
Better algorithms for unfair metrical task systems and applications
Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems...
Amos Fiat, Manor Mendel
PRL
2000
62views more  PRL 2000»
15 years 6 months ago
Interactive initialization of the multilayer perceptron
A new multilayer preceptor initialization method is proposed and compared experimentally with a traditional random initialization method. An operator maps training-set vectors int...
Aistis Raudys
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 8 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
16 years 7 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty