Sciweavers

657 search results - page 43 / 132
» A Version Numbering Scheme with a Useful Lexicographical Ord...
Sort
View
IACR
2011
212views more  IACR 2011»
13 years 9 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...
COCOON
2006
Springer
15 years 1 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
IICAI
2003
14 years 11 months ago
Performance Analysis of an Acyclic Genetic approach to Learn Bayesian Network Structure
Abstract. We introduce a new genetic algorithm approach for learning a Bayesian network structure from data. Our method is capable of learning over all node orderings and structure...
Pankaj B. Gupta, Vicki H. Allan
COMPGEOM
2010
ACM
15 years 2 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
CSR
2007
Springer
15 years 3 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma