Sciweavers

30 search results - page 4 / 6
» Computation of a Class of COntinued Fraction Constants
Sort
View
PKC
2005
Springer
167views Cryptology» more  PKC 2005»
14 years 28 days ago
Converse Results to the Wiener Attack on RSA
A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-...
Ron Steinfeld, Scott Contini, Huaxiong Wang, Josef...
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
13 years 11 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
PRDC
2005
IEEE
14 years 1 months ago
Server Protection through Dynamic Patching
Recently, hackers has been developing fast propagating worms exploiting vulnerabilities that had just been disclosed by security experts. Those attacks particularly expose servers...
Nicolas Loriant, Marc Ségura-Devillechaise,...
CMSB
2008
Springer
13 years 9 months ago
A Model Checking Approach to the Parameter Estimation of Biochemical Pathways
Model checking has historically been an important tool to verify models of a wide variety of systems. Typically a model has to exhibit certain properties to be classed `acceptable&...
Robin Donaldson, David Gilbert
FSTTCS
2008
Springer
13 years 8 months ago
STCON in Directed Unique-Path Graphs
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
Sampath Kannan, Sanjeev Khanna, Sudeepa Roy