Sciweavers

730 search results - page 40 / 146
» Faster dimension reduction
Sort
View
TCS
2010
13 years 7 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre
CRYPTO
2007
Springer
144views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
Jean-Sébastien Coron
SCN
2010
Springer
122views Communications» more  SCN 2010»
13 years 7 months ago
Recursive Lattice Reduction
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
Thomas Plantard, Willy Susilo
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
14 years 11 days ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...
CMSB
2008
Springer
13 years 10 months ago
Automatic Complexity Analysis and Model Reduction of Nonlinear Biochemical Systems
Kinetic models for biochemical systems often comprise a large amount of coupled differential equations with species concentrations varying on different time scales. In this paper w...
Dirk Lebiedz, Dominik Skanda, Marc Fein