193 search results - page 29 / 39 » Exponential lower bounds for the numbers of Skolem-type sequ... |
ESA
2004
Springer
14 years 24 days ago
2004
Springer
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...
JC
2007
13 years 7 months ago
2007
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments ...
TWC
2010
13 years 2 months ago
2010
Abstract--One of the major drawbacks of orthogonal frequency division multiplexing (OFDM) signals is the high peak to average power ratio (PAPR) of the transmitted signal. Many PAP...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
QEST
2008
IEEE
14 years 1 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...