Sciweavers

2925 search results - page 39 / 585
» Information Complexity of Online Problems
Sort
View
NIPS
2007
15 years 7 months ago
Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
M. M. Mahmud, Sylvian R. Ray
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
16 years 3 days ago
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
Niv Buchbinder, Kamal Jain, Joseph Naor
TKDE
2011
363views more  TKDE 2011»
15 years 26 days ago
Efficient Techniques for Online Record Linkage
—The need to consolidate the information contained in heterogeneous data sources has been widely documented in recent years. In order to accomplish this goal, an organization mus...
Debabrata Dey, Vijay S. Mookerjee, Dengpan Liu
COLT
2007
Springer
16 years 3 days ago
Online Learning with Prior Knowledge
The standard so-called experts algorithms are methods for utilizing a given set of “experts” to make good choices in a sequential decision-making problem. In the standard setti...
Elad Hazan, Nimrod Megiddo
AAAI
2010
15 years 7 months ago
Collusion Detection in Online Bridge
Collusion is a major unsolved security problem in online bridge: by illicitly exchanging card information over the telephone, instant messenger or the like, cheaters can gain huge...
Jeff Yan