Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
48
DESIGN CONCEPTS FOR MATRICES AND LATTICES IN I_iDIA
"... In this paper we present a new template class concept for matrices and lattices. In the design we have focussed on the efficiency of single as well as sequences of operations. In order to get concise and efficient programming code we present a new technique based on template mechanisms and suitable ..."
Abstract
- Add to MetaCart
In this paper we present a new template class concept for matrices and lattices. In the design we have focussed on the efficiency of single as well as sequences of operations. In order to get concise and efficient programming code we present a new technique based on template mechanisms and suitable
On generalized branching methods for mixed integer programming
, 2004
"... In this paper we present a restructuring of the computations in Lenstra’s methods for solving mixed integer linear programs. We show that the problem of finding a good branching hyperplane can be formulated on an adjoint lattice of the Kernel lattice of the equality constraints without requiring any ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
any dimension reduction. As a consequence the short lattice vector finding algorithms, such as Lenstra, Lenstra, Lovász (LLL) [15] or the generalized basis reduction algorithm of Lovász and Scarf [18] are described in the space of original variables. Based on these results we give a new natural
Scenario Generation and Reduction for Long-term and Short-term Power System Generation Planning under Uncertainties
"... ii ..."
Hardness of k-LWE and Applications in Traitor Tracing
"... Abstract. We introduce the k-LWE problem, a Learning With Errors variant of the k-SIS problem. The Boneh-Freeman reduction from SIS to k-SIS suffers from an ex-ponential loss in k. We improve and extend it to an LWE to k-LWE reduction with a polynomial loss in k, by relying on a new technique involv ..."
Abstract
-
Cited by 8 (3 self)
- Add to MetaCart
Abstract. We introduce the k-LWE problem, a Learning With Errors variant of the k-SIS problem. The Boneh-Freeman reduction from SIS to k-SIS suffers from an ex-ponential loss in k. We improve and extend it to an LWE to k-LWE reduction with a polynomial loss in k, by relying on a new technique
Hardness of k-LWE and Applications in Traitor Tracing San Ling 1
"... Abstract. We introduce the k-LWE problem, a Learning With Errors variant of the k-SIS problem. The Boneh-Freeman reduction from SIS to k-SIS suffers from an ex-ponential loss in k. We improve and extend it to an LWE to k-LWE reduction with a polynomial loss in k, by relying on a new technique involv ..."
Abstract
- Add to MetaCart
Abstract. We introduce the k-LWE problem, a Learning With Errors variant of the k-SIS problem. The Boneh-Freeman reduction from SIS to k-SIS suffers from an ex-ponential loss in k. We improve and extend it to an LWE to k-LWE reduction with a polynomial loss in k, by relying on a new technique
and
, 2015
"... Effective support for custom proof automation is essential for large-scale interactive proof develop-ment. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely on adva ..."
Abstract
- Add to MetaCart
of typed tactical primitives. We avoid the need to touch the trusted kernel type-checker of Coq by encapsulating uses of these new tactical primitives in a monad, and instrumenting Coq so that it executes monadic tactics during type inference. 1
USENIX Association 11th USENIX Conference on File and Storage Technologies (FAST ’13) 215 Getting Real: Lessons in Transitioning Research Simulations into Hardware Systems
"... Flash-based solid-state drives have revolutionized stor-age with their high performance. Their sophisticated in-ternal mechanisms have led to a plethora of research on how to optimize applications, file systems, and internal SSD designs. Due to the closed nature of commercial de-vices though, most r ..."
Abstract
- Add to MetaCart
research on the internals of an SSD, such as enhanced flash-translation layers, is performed using simulation or emulation. Without implementation in real devices, it can be difficult to judge the true benefit of the proposed designs. In this paper, we describe our efforts to implement two new SSD designs
Quasi-Monte Carlo sampling for stochastic variational problems
"... • Computational methods for solving stochastic variational problems require (first) a discretization of the underlying probability distribution induced by a numerical integration scheme for the approximate computation of expec-tations and (second) an efficient solver for a (large scale) finite-dimen ..."
Abstract
- Add to MetaCart
• Computational methods for solving stochastic variational problems require (first) a discretization of the underlying probability distribution induced by a numerical integration scheme for the approximate computation of expec-tations and (second) an efficient solver for a (large scale) finite-dimensional
Results 1 - 10
of
48
