Sciweavers

GCB
2000
Springer
99views Biometrics» more  GCB 2000»
14 years 1 months ago
Structure Motif Discovery and Mining the PDB
We describe an algorithm for the automatic discovery of recurring patterns in protein structures. The patterns consist of individual residues having a defined order along the prote...
Inge Jonassen, Ingvar Eidhammer, Darrell Conklin, ...
FPGA
2000
ACM
119views FPGA» more  FPGA 2000»
14 years 1 months ago
Timing-driven placement for FPGAs
In this paper we introduce a new Simulated Annealingbased timing-driven placement algorithm for FPGAs. This paper has three main contributions. First, our algorithm employs a nove...
Alexander Marquardt, Vaughn Betz, Jonathan Rose
FMCAD
2000
Springer
14 years 1 months ago
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
Roderick Bloem, Harold N. Gabow, Fabio Somenzi
EUROPAR
2000
Springer
14 years 1 months ago
BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations
We present a compiler algorithm called BitValue, which can discover both unused and constant bits in dusty-deck C programs. BitValue uses forward and backward dataflow analyses, ge...
Mihai Budiu, Majd Sakr, Kip Walker, Seth Copen Gol...
EUROCRYPT
2000
Springer
14 years 1 months ago
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard ove...
Nicolas Courtois, Alexander Klimov, Jacques Patari...
DNA
2000
Springer
148views Bioinformatics» more  DNA 2000»
14 years 1 months ago
A Space-Efficient Randomized DNA Algorithm for k-SAT
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...
Kevin Chen, Vijay Ramachandran
CIAC
2000
Springer
121views Algorithms» more  CIAC 2000»
14 years 1 months ago
An Efficient Algorithm for the Approximate Median Selection Problem
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
Sebastiano Battiato, Domenico Cantone, Dario Catal...
CHES
2000
Springer
121views Cryptology» more  CHES 2000»
14 years 1 months ago
On Boolean and Arithmetic Masking against Differential Power Analysis
Abstract. Since the announcement of the Differential Power Analysis (DPA) by Paul Kocher and al., several countermeasures were proposed in order to protect software implementations...
Jean-Sébastien Coron, Louis Goubin
ALT
2000
Springer
14 years 1 months ago
Computationally Efficient Transductive Machines
In this paper1 we propose a new algorithm for providing confidence and credibility values for predictions on a multi-class pattern recognition problem which uses Support Vector mac...
Craig Saunders, Alexander Gammerman, Volodya Vovk
COMPGEOM
2001
ACM
14 years 1 months ago
A practical approach for computing the diameter of a point set
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
Sariel Har-Peled