Sciweavers

676 search results - page 98 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
EOR
2002
105views more  EOR 2002»
13 years 8 months ago
Two-dimensional packing problems: A survey
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
Andrea Lodi, Silvano Martello, Michele Monaci
JAR
2010
160views more  JAR 2010»
13 years 7 months ago
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
Behzad Akbarpour, Lawrence C. Paulson
SIAMCO
2010
114views more  SIAMCO 2010»
13 years 3 months ago
Discrete Carleman Estimates for Elliptic Operators in Arbitrary Dimension and Applications
In arbitrary dimension, we consider the semi-discrete elliptic operator -2 t + AM , where AM is a finite difference approximation of the operator - x((x) x). For this operator we d...
Franck Boyer, Florence Hubert, Jérôme...
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
14 years 9 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
PODS
2001
ACM
135views Database» more  PODS 2001»
14 years 8 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...