282 search results - page 30 / 57 » Online Learning of Approximate Dependency Parsing Algorithms |
AAAI
2007
13 years 10 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form o...
IPSN
2010
Springer
14 years 2 months ago
2010
Springer
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
IEEECIT
2009
IEEE
14 years 2 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...