1171 search results - page 150 / 235 » Multisource Algorithmic Information Theory |
COLT
1999
Springer
14 years 1 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
CIKM
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
PODS
1995
ACM
14 years 25 days ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...