Sciweavers

971 search results - page 36 / 195
» Approximate Satisfiability and Equivalence
Sort
View
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
13 years 7 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes
ICIP
1998
IEEE
14 years 11 months ago
Minimum Support Interpolators with Optimum Approximation Properties
Abstract- We investigate the functions of given approximation order L that have the smallest support. Those are shown to be linear combinations of the Bspline of degree .L - 1 and ...
Michael Unser, Philippe Thévenaz, Thierry B...
ICDE
2003
IEEE
96views Database» more  ICDE 2003»
14 years 11 months ago
Pushing Aggregate Constraints by Divide-and-Approximate
Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone co...
Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong...
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
14 years 10 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor
UAI
2008
13 years 11 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht