3718 search results - page 442 / 744 » On learning with dissimilarity functions |
172
Voted
AAAI
2010
15 years 8 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
169
Voted
NIPS
2007
15 years 8 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
169
click to vote
UAI
2008
15 years 8 months ago
2008
We introduce a new type of graphical model called a `cumulative distribution network' (CDN), which expresses a joint cumulative distribution as a product of local functions. ...
162
click to vote
NIPS
2003
15 years 8 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
150
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way...