Sciweavers

1672 search results - page 13 / 335
» Tightness problems in the plane
Sort
View
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
14 years 2 months ago
Two for One: Tight Approximation of 2D Bin Packing
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 ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
13 years 11 months ago
Tight Results on Minimum Entropy Set Cover
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
14 years 1 months ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
Benoît Chevallier-Mames, Marc Joye

Publication
151views
12 years 6 months ago
Robust Bayesian reinforcement learning through tight lower bounds
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
Christos Dimitrakakis
COCOON
2005
Springer
14 years 1 months ago
A Tight Analysis of the Maximal Matching Heuristic
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
Jean Cardinal, Martine Labbé, Stefan Langer...