Sciweavers

969 search results - page 43 / 194
» Generalized matching from theory to application
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Learning to rank from Bayesian decision inference
Ranking is a key problem in many information retrieval (IR) applications, such as document retrieval and collaborative filtering. In this paper, we address the issue of learning ...
Jen-Wei Kuo, Pu-Jen Cheng, Hsin-Min Wang
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 8 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
FOCS
1999
IEEE
14 years 10 days ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
WWW
2008
ACM
14 years 8 months ago
Ranking refinement and its application to information retrieval
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
Rong Jin, Hamed Valizadegan, Hang Li
POPL
2010
ACM
14 years 5 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner