Sciweavers

30 search results - page 2 / 6
» The Clarkson-Shor technique revisited and extended
Sort
View
IEEEPACT
2008
IEEE
13 years 11 months ago
Redundancy elimination revisited
This work proposes and evaluates improvements to previously known algorithms for redundancy elimination. Enhanced Scalar Replacement combines two classic techniques, scalar replac...
Keith D. Cooper, Jason Eckhardt, Ken Kennedy
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
13 years 11 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
PVLDB
2008
118views more  PVLDB 2008»
13 years 4 months ago
Column-store support for RDF data management: not all swans are white
This paper reports on the results of an independent evaluation of the techniques presented in the VLDB 2007 paper "Scalable Semantic Web Data Management Using Vertical Partit...
Lefteris Sidirourgos, Romulo Goncalves, Martin L. ...
ICISC
2004
99views Cryptology» more  ICISC 2004»
13 years 6 months ago
Fractional Windows Revisited: Improved Signed-Digit Representations for Efficient Exponentiation
Abstract. This paper extends results concerning efficient exponentiation in groups where inversion is easy (e.g. in elliptic curve cryptography). It examines the right-to-left and ...
Bodo Möller
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
13 years 4 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak