Sciweavers

1414 search results - page 120 / 283
» Randomness and Universal Machines
Sort
View

Publication
170views
13 years 9 months ago
Covariance Regularization for Supervised Learning in High Dimensions
This paper studies the effect of covariance regularization for classific ation of high-dimensional data. This is done by fitting a mixture of Gaussians with a regularized covaria...
Daniel L. Elliott, Charles W. Anderson, Michael Ki...
INCDM
2010
Springer
138views Data Mining» more  INCDM 2010»
13 years 8 months ago
Learning Discriminative Distance Functions for Case Retrieval and Decision Support
The importance of learning distance functions is gradually being acknowledged by the machine learning community, and different techniques are suggested that can successfully learn ...
Alexey Tsymbal, Martin Huber, Shaohua Kevin Zhou
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
14 years 4 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang
CIE
2005
Springer
14 years 3 months ago
Computing a Model of Set Theory
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
Peter Koepke
COLT
2005
Springer
14 years 3 months ago
Trading in Markovian Price Models
We examine a Markovian model for the price evolution of a stock, in which the probability of local upward or downward movement is arbitrarily dependent on the current price itself...
Sham M. Kakade, Michael J. Kearns