Sciweavers

1439 search results - page 86 / 288
» Fast approximation of centrality
Sort
View
IJNSEC
2006
132views more  IJNSEC 2006»
14 years 10 months ago
A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent a...
Sahadeo Padhye, Birendra Kumar Sharma
JCC
2008
117views more  JCC 2008»
14 years 10 months ago
FACTS: Fast analytical continuum treatment of solvation
: An efficient method for calculating the free energy of solvation of a (macro)molecule embedded in a continuum solvent is presented. It is based on the fully analytical evaluation...
Urs Haberthür, Amedeo Caflisch
WABI
2010
Springer
172views Bioinformatics» more  WABI 2010»
14 years 8 months ago
Fast Mapping and Precise Alignment of AB SOLiD Color Reads to Reference DNA
Abstract. Applied Biosystems’ SOLiD system offers a low-cost alternative to the traditional Sanger method of DNA sequencing. We introduce two main algorithms of mapping SOLiD’...
Miklós Csürös, Szilveszter Juhos,...
CORR
2010
Springer
90views Education» more  CORR 2010»
14 years 7 months ago
Fast Pseudo-Random Fingerprints
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
Yoram Bachrach, Ely Porat
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
14 years 5 months ago
A fast well-conditioned interior point method for predictive control
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
Amir Shahzad, Eric C. Kerrigan, George A. Constant...