Sciweavers

155 search results - page 14 / 31
» On learning linear ranking functions for beam search
Sort
View
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 6 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
AIRS
2010
Springer
13 years 5 months ago
Relevance Ranking Using Kernels
This paper is concerned with relevance ranking in search, particularly that using term dependency information. It proposes a novel and unified approach to relevance ranking using ...
Jun Xu, Hang Li, Chaoliang Zhong
JMLR
2006
125views more  JMLR 2006»
13 years 7 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
ICML
1998
IEEE
14 years 8 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...
IRI
2007
IEEE
14 years 1 months ago
BESearch: A Supervised Learning Approach to Search for Molecular Event Participants
Biomedical researchers rely on keyword-based search engines to retrieve superficially relevant documents, from which they must filter out irrelevant information manually. Hence, t...
Richard Tzong-Han Tsai, Hong-Jie Dai, Hsi-Chuan Hu...