Sciweavers

5214 search results - page 384 / 1043
» The Online Specialization Problem
Sort
View
JMLR
2010
118views more  JMLR 2010»
15 years 1 months ago
Learning to Rank for Personalized News Article Retrieval
This paper aims to tackle the very interesting and important problem of user personalized ranking of search results. The focus is on news retrieval and the data from which the ran...
Lorand Dali, Blaz Fortuna, Jan Rupnik
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 7 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
FOCS
2008
IEEE
16 years 1 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
ICCNMC
2005
Springer
16 years 12 days ago
Minimum Disc Cover Set Construction in Mobile Ad Hoc Networks
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
Min-Te Sun, Xiaoli Ma, Chih-Wei Yi, Chuan-Kai Yang...
FOCS
2004
IEEE
15 years 10 months ago
The Hardness of Metric Labeling
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
Julia Chuzhoy, Joseph Naor