258 search results - page 24 / 52 » New Lower Bounds for Heilbronn Numbers |
COCO
2009
Springer
15 years 6 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
COCO
2009
Springer
15 years 6 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
208
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
JMIV
2006
14 years 11 months ago
2006
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...
104
click to vote
ICALP
1999
Springer
15 years 4 months ago
1999
Springer
We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing character...