888 search results - page 145 / 178 » Learning to Select a Ranking Function |
129
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
149
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Word sense disambiguation (WSD) algorithms attempt to select the proper sense of ambiguous terms in text. Resources like the UMLS provide a reference thesaurus to be u...
144
Voted
PRL
2010
15 years 2 months ago
2010
: Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organ...
145
Voted
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
122
click to vote
ICCBR
2007
Springer
15 years 10 months ago
2007
Springer
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...