Sciweavers

1982 search results - page 217 / 397
» Designing Efficient Distributed Algorithms Using Sampling Te...
Sort
View
SSWMC
2004
15 years 4 months ago
Searching for the stego-key
Steganalysis in the wide sense consists of first identifying suspicious objects and then further analysis during which we try to identify the steganographic scheme used for embedd...
Jessica J. Fridrich, Miroslav Goljan, David Soukal
129
Voted
IMSCCS
2006
IEEE
15 years 9 months ago
Degenerated Primer Design to Amplify the Heavy Chain Variable Region from Immunoglobulin cDNA
Background: The amplification of variable regions of immunoglobulins has become a major challenge in the cloning of antibody genes, whether from hybridoma cell lines or splenic B ...
Wang Ying, Chen Wei, Li Xu, Cheng Bing
PARA
1994
Springer
15 years 7 months ago
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
José M. Badía, Antonio M. Vidal
135
Voted
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 7 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
163
Voted
HPCA
1998
IEEE
15 years 7 months ago
Hardware for Speculative Run-Time Parallelization in Distributed Shared-Memory Multiprocessors
Run-time parallelization is often the only way to execute the code in parallel when data dependence information is incomplete at compile time. This situation is common in many imp...
Ye Zhang, Lawrence Rauchwerger, Josep Torrellas