Sciweavers

973 search results - page 78 / 195
» New Bounds on Crossing Numbers
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
14 years 12 months ago
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
Robert Hildebrand, Matthias Köppe
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 2 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
DCC
2005
IEEE
15 years 11 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
EOR
2008
82views more  EOR 2008»
14 years 12 months ago
Solving the pallet loading problem
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxe...
Gustavo H. A. Martins, Robert F. Dell
JMIV
2006
78views more  JMIV 2006»
14 years 12 months ago
Shape Estimation from Support and Diameter Functions
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...
Amyn Poonawala, Peyman Milanfar, Richard J. Gardne...