Sciweavers

1051 search results - page 112 / 211
» On the Correspondence between Approximations and Similarity
Sort
View
ML
2002
ACM
168views Machine Learning» more  ML 2002»
15 years 6 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy
BMVC
2010
15 years 4 months ago
Embedding Visual Words into Concept Space for Action and Scene Recognition
In this paper we propose a novel approach to introducing semantic relations into the bag-of-words framework. We use the latent semantic models, such as LSA and pLSA, in order to d...
Behrouz Khadem, Elahe Farahzadeh, Deepu Rajan, And...
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
15 years 4 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
SCHOLARPEDIA
2011
14 years 9 months ago
Color mixture
: In 1613 d’Aguilon published a book on optics containing a novel color mixture diagram in arc form. Diagrams of similar form are found in many medieval manuscripts where they ha...
Rolf G. Kuehni
GRC
2010
IEEE
15 years 7 months ago
Optimal Factorization of Three-Way Binary Data
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...
Radim Belohlávek, Vilém Vychodil