Sciweavers

471 search results - page 4 / 95
» Faster Multiplication in GF(2)[x]
Sort
View
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
14 years 2 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
ASIACRYPT
2007
Springer
14 years 4 months ago
Faster Addition and Doubling on Elliptic Curves
Edwards recently introduced a new normal form for elliptic curves. Every elliptic curve over a non-binary field is birationally equivalent to a curve in Edwards form over an exten...
Daniel J. Bernstein, Tanja Lange
ADC
2008
Springer
135views Database» more  ADC 2008»
14 years 4 months ago
Faster Path Indexes for Search in XML Data
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
Nils Grimsmo
ASIACRYPT
2010
Springer
13 years 7 months ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
Damien Stehlé, Ron Steinfeld
CORR
1998
Springer
105views Education» more  CORR 1998»
13 years 9 months ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas