Sciweavers

230 search results - page 42 / 46
» Cryptanalysis of the Quadratic Generator
Sort
View
EMSOFT
2009
Springer
14 years 2 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 2 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
ICDCS
2008
IEEE
14 years 2 months ago
Correlation-Aware Object Placement for Multi-Object Operations
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...
Ming Zhong, Kai Shen, Joel I. Seiferas
SCALESPACE
2007
Springer
14 years 1 months ago
Scale Spaces on Lie Groups
In the standard scale space approach one obtains a scale space representation u : Rd R+ → R of an image f ∈ L2(Rd ) by means of an evolution equation on the additive group (Rd ...
Remco Duits, Bernhard Burgeth
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci