Sciweavers

6358 search results - page 86 / 1272
» Computing spectral sequences
Sort
View
95
Voted
SIAMNUM
2010
106views more  SIAMNUM 2010»
14 years 10 months ago
Computing Sacker-Sell spectra in Discrete Time Dynamical Systems
In this paper we develop boundary value methods for detecting Sacker-Sell spectra in discrete time dynamical systems. The algorithms are advancements of earlier methods for comput...
Thorsten Hüls
105
Voted
ISMVL
2002
IEEE
84views Hardware» more  ISMVL 2002»
15 years 8 months ago
The Role of Super-Fast Transforms in Speeding Up Quantum Computations
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...
Zeljko Zilic, Katarzyna Radecka
142
Voted
ISMB
1996
15 years 5 months ago
Compact Encoding Strategies for DNA Sequence Similarity Search
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
David J. States, Pankaj Agarwal
144
Voted
IJIT
2004
15 years 5 months ago
Parallezation Protein Sequence Similarity Algorithms using Remote Method Interface
One of the major problems in genomic field is to perform sequence comparison on DNA and protein sequences. Executing sequence comparison on the DNA and protein data is a computatio...
Mubarak Saif Mohsen, Zurinahni Zainol, Rosalina Ab...
126
Voted
ACL
2009
15 years 1 months ago
A non-contiguous Tree Sequence Alignment-based Model for Statistical Machine Translation
The tree sequence based translation model allows the violation of syntactic boundaries in a rule to capture non-syntactic phrases, where a tree sequence is a contiguous sequence o...
Jun Sun, Min Zhang, Chew Lim Tan