Sciweavers

9 search results - page 2 / 2
» Approximating fractional hypertree width
Sort
View
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 3 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
IACR
2011
212views more  IACR 2011»
12 years 5 months ago
Fully Homomorphic Encryption without Bootstrapping
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
Zvika Brakerski, Craig Gentry, Vinod Vaikuntanatha...
DAM
2008
117views more  DAM 2008»
13 years 5 months ago
Analysis on the strip-based projection model for discrete tomography
Discrete tomography deals with image reconstruction of an object with finitely many gray levels (such as two). Different approaches are used to model the raw detector reading. The...
Jiehua Zhu, Xiezhang Li, Yangbo Ye, Ge Wang
COMPGEOM
2006
ACM
13 years 11 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...