Sciweavers

461 search results - page 60 / 93
» Practical polynomial factoring in polynomial time
Sort
View
EUROCRYPT
2005
Springer
15 years 3 months ago
Floating-Point LLL Revisited
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
Phong Q. Nguyen, Damien Stehlé
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
15 years 3 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
15 years 6 months ago
System-wide energy minimization for real-time tasks: lower bound and approximation
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...
Xiliang Zhong, Cheng-Zhong Xu
ICPP
2005
IEEE
15 years 3 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
GD
2005
Springer
15 years 3 months ago
C-Planarity of Extrovert Clustered Graphs
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....