Sciweavers

539 search results - page 31 / 108
» Recurrence relations and fast algorithms
Sort
View
86
Voted
MOBICOM
2006
ACM
15 years 6 months ago
Fast and reliable estimation schemes in RFID systems
RFID tags are being used in many diverse applications in increasingly large numbers. These capabilities of these tags span from very dumb passive tags to smart active tags, with t...
Murali S. Kodialam, Thyaga Nandagopal
SOFSEM
2010
Springer
15 years 9 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
15 years 5 months ago
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
Nicolas Courtois
NIPS
2003
15 years 1 months ago
Generalised Propagation for Fast Fourier Transforms with Partial or Missing Data
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where ...
Amos J. Storkey
117
Voted
FTTCS
2006
132views more  FTTCS 2006»
15 years 13 days ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter