Sciweavers

3096 search results - page 108 / 620
» The Generalized FITC Approximation
Sort
View
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
14 years 9 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin
SIGMOD
2009
ACM
111views Database» more  SIGMOD 2009»
14 years 9 months ago
Language-model-based ranking in entity-relation graphs
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
14 years 2 months ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
14 years 1 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
ICML
1995
IEEE
14 years 9 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon