Sciweavers

3837 search results - page 88 / 768
» Learning Approximate Consistencies
Sort
View
FOCS
2008
IEEE
15 years 10 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
SCIA
2007
Springer
131views Image Analysis» more  SCIA 2007»
15 years 10 months ago
Performance Comparison of Techniques for Approximating Image-Based Lighting by Directional Light Sources
Abstract. Image-Based Lighting (IBL) has become a very popular approach in computer graphics. In essence IBL is based on capturing the illumination conditions in a scene in an omni...
Claus B. Madsen, Rune E. Laursen
ESA
2005
Springer
146views Algorithms» more  ESA 2005»
15 years 9 months ago
An Approximation Algorithm for the Minimum Latency Set Cover Problem
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
Refael Hassin, Asaf Levin
TCS
2008
15 years 4 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
IOR
2007
58views more  IOR 2007»
15 years 4 months ago
Bounds, Heuristics, and Approximations for Distribution Systems
This paper develops simple approximate methods to analyze a two-stage stochastic distribution system consisting of one warehouse and multiple retailers. We consider local and cent...
Guillermo Gallego, Özalp Özer, Paul H. Z...