Sciweavers

1675 search results - page 188 / 335
» The Value of a Good Name
Sort
View
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 11 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
IPCO
2010
125views Optimization» more  IPCO 2010»
13 years 10 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
NIPS
2004
13 years 10 months ago
Confidence Intervals for the Area Under the ROC Curve
In many applications, good ranking is a highly desirable performance for a classifier. The criterion commonly used to measure the ranking quality of a classification algorithm is ...
Corinna Cortes, Mehryar Mohri
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 9 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
CGF
2007
149views more  CGF 2007»
13 years 9 months ago
Interactive Simulation of the Human Eye Depth of Field and Its Correction by Spectacle Lenses
This paper describes a fast rendering algorithm for verification of spectacle lens design. Our method simulates refraction corrections of astigmatism as well as myopia or presbyo...
Masanori Kakimoto, Tomoaki Tatsukawa, Yukiteru Muk...