Sciweavers

1578 search results - page 44 / 316
» Algorithmic randomness of continuous functions
Sort
View
CCA
2009
Springer
15 years 4 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
CISS
2007
IEEE
15 years 4 months ago
Towards Optimal Design of Data Hiding Algorithms Against Nonparametric Adversary Models
Abstract—This paper presents a novel zero-sum watermarking game between a detection algorithm and a data hiding adversary. Contrary to previous research, the detection algorithm ...
Alvaro A. Cárdenas, George V. Moustakides, ...
JMLR
2012
13 years 4 days ago
Randomized Optimum Models for Structured Prediction
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
Daniel Tarlow, Ryan Prescott Adams, Richard S. Zem...
73
Voted
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
14 years 11 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan
82
Voted
IJCNN
2007
IEEE
15 years 4 months ago
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
Ling Li, Hsuan-Tien Lin