Sciweavers

464 search results - page 8 / 93
» Improved Fixed-Parameter Algorithms for Two Feedback Set Pro...
Sort
View
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
11 years 9 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
IJCGA
2002
73views more  IJCGA 2002»
13 years 6 months ago
A Simple Factor-2/3 Approximation Algorithm for Two-Circle Point Labeling
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
Alexander Wolff, Michael Thon, Yin-Feng Xu
FOCS
2006
IEEE
14 years 23 days ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
SSIAI
2002
IEEE
13 years 11 months ago
Two Dimensional Projective Point Matching
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
Jason Denton, J. Ross Beveridge
WWW
2008
ACM
14 years 7 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