97 search results - page 18 / 20 » Logarithmic Regret Algorithms for Online Convex Optimization |
WEBI
2010
Springer
14 years 7 months ago
2010
Springer
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This work shows asymptotic convergence to global optima for a family of dynamically scaled genetic programming systems where the underlying population consists of a fixed number o...
EMNLP
2010
14 years 7 months ago
2010
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
62
Voted
CSR
2007
Springer
15 years 3 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...