A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Time Bounds for Streaming Problems

2019
*
Theory of Computing
*

We give tight cell-probe

doi:10.4086/toc.2019.v015a002
dblp:journals/toc/CliffordJS19
fatcat:fnvfj6gqfzazlgw6uecuhsqeda
*bounds**for*the*time*to compute convolution, multiplication and Hamming distance in a*stream*. ...*For*each of these three*problems*, we give a lower*bound*of Ω ((δ /w) log n)*time*on average per output symbol, where δ is the number of bits needed to represent an input symbol and w is the cell or word ... As a consequence our online lower*bounds**for*these two*problems*match the best known*time*upper*bounds**for*the offline*problem*. ...##
###
Time Bounds for Streaming Problems
[article]

2014
*
arXiv
*
pre-print

We give tight cell-probe

arXiv:1412.6935v1
fatcat:yxxsxlx6bfe3tmtv22lxzb5eja
*bounds**for*the*time*to compute convolution, multiplication and Hamming distance in a*stream*. ...*For*each of these three*problems*, we give a lower*bound*of Ω(δ/w n)*time*on average per output, where δ is the number of bits needed to represent an input symbol and w is the cell or word size. ... We thank Kasper Green Larsen in particular*for*pointing out that the cell-probe lower*bounds*we give are in fact tight. ...##
###
Time lower bounds for nonadaptive turnstile streaming algorithms
[article]

2014
*
arXiv
*
pre-print

We prove the first non-trivial update

arXiv:1407.2151v1
fatcat:j2f7nmmfcbd4zhk5mvdrpjdk2y
*time*lower*bounds**for*both randomized and deterministic turnstile*streaming*algorithms, which hold when the algorithms are non-adaptive. ... Our lower*bounds*hold against classically studied*problems*such as heavy hitters, point query, entropy estimation, and moment estimation. ... Can we use techniques from cell probe lower*bound*proofs to lower*bound*the update*time*complexity*for*classical*streaming**problems*? ...##
###
Towards a Theory of Parameterized Streaming Algorithms

2019
*
International Symposium on Parameterized and Exact Computation
*

On the hardness side, we obtain lower

doi:10.4230/lipics.ipec.2019.7
dblp:conf/iwpec/ChitnisC19
fatcat:c4qnqaa6bnf5lhbh5dp33uf6hi
*bounds**for*the parameterized*streaming*complexity of various*problems*via novel reductions from*problems*in communication complexity. ...*For*example, the latter shows how to refine the Ω(n 2 ) bit lower*bound**for*finding a minimum Vertex Cover (VC) in the*streaming*setting by designing an algorithm*for*the parameterized k-VC*problem*which ... Acknowledgements We thank MohammadTaghi Hajiaghayi, Robert Krauthgamer and Morteza Monemizadeh*for*helpful discussions. Algorithm 1 was suggested to us by Arnold Filtser. ...##
###
Generalized Rate Analysis for Media-Processing Platforms

2006
*
12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)
*

In this paper we address the "rate analysis"

doi:10.1109/rtcsa.2006.35
dblp:conf/rtcsa/LiuCM06
fatcat:yatfbu7lbnf3bm36oecxacywky
*problem**for*media-processing platforms consisting of multiple processor cores connected in a pipelined fashion. ... More precisely, we aim at determining tight*bounds*on the rates at which multimedia*streams*can be fed into such architectures. ... The authors would also like to thank the anonymous reviewers*for*their suggestions, which helped in improving the paper. ...##
###
Pattern Matching in Multiple Streams
[article]

2012
*
arXiv
*
pre-print

We give almost matching upper and lower space

arXiv:1202.3470v2
fatcat:b4oazacdljcwtb74ee7mcvsn3a
*bounds**for*three distinct pattern matching*problems*. ...*For*the k-mismatch and k-difference*problems*we give O(k)*time*solutions that require O(m+ks) words of space. ... In Section 7 we give almost matching space lower*bounds**for*our*problems*as well as lower*bounds**for*some other common pattern matching*problems*. ...##
###
Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms

2015
*
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing - STOC '15
*

We prove the first non-trivial update

doi:10.1145/2746539.2746542
dblp:conf/stoc/LarsenNN15
fatcat:ktbbdyhbqzemfcplk2qmixpyxq
*time*lower*bounds**for*both randomized and deterministic turnstile*streaming*algorithms, which hold when the algorithms are non-adaptive. ... All known turnstile*streaming*algorithms in the literature, except a single recent example*for*a particular promise*problem*[7], are non-adaptive. ... Can we use techniques from cell probe lower*bound*proofs to lower*bound*the*time*complexity*for*classical*streaming**problems*? ...##
###
Lexicographically optimal smoothing for broadband traffic multiplexing

2002
*
Proceedings of the twenty-first annual symposium on Principles of distributed computing - PODC '02
*

Previous approaches in the literature

doi:10.1145/571831.571835
fatcat:34zy5asw3ba47pv5rewkmksa44
*for*the data access*problem*handled either the case of only a single*stream*or did not compute the lexicographically optimal schedule. ...*For*the data access*problem*, we handle the general case of a shared buffer capacity and individual network bandwidth constraints. ... Acknowledgments We would like to thank the anonymous reviewers*for*suggestions that improved the presentation of the paper. ...##
###
Lexicographically optimal smoothing for broadband traffic multiplexing

2002
*
Proceedings of the twenty-first annual symposium on Principles of distributed computing - PODC '02
*

Previous approaches in the literature

doi:10.1145/571825.571835
dblp:conf/podc/AnastasiadisVVY02
fatcat:liyblffijncprp76n3iphjlika
*for*the data access*problem*handled either the case of only a single*stream*or did not compute the lexicographically optimal schedule. ...*For*the data access*problem*, we handle the general case of a shared buffer capacity and individual network bandwidth constraints. ... Acknowledgments We would like to thank the anonymous reviewers*for*suggestions that improved the presentation of the paper. ...##
###
Optimal Lexicographic Shaping of Aggregate Streaming Data

2005
*
IEEE transactions on computers
*

Previous approaches

doi:10.1109/tc.2005.67
fatcat:467lm7cmmjdbraol5tn5m3rabm
*for*the data access*problem*handled either the case of only a single*stream*or did not compute the lexicographically optimal schedule. ...*For*the data access*problem*, we handle the general case of a shared buffer capacity and individual network bandwidth constraints. ... The lower*bound*at*time*step i*for*each saturating*stream*k must be increased by U k ðiÞ À L k ðiÞ, while the corresponding lower*bound**for*nonsaturating*streams*must be increased by L k ðjÞ À L k ðiÞ. ...##
###
Incorporating heat integration in batch process scheduling

2003
*
Applied Thermal Engineering
*

The formerly introduced S-graph approach [AIChE J. 48 (2002[AIChE J. 48 ( ) 2557[AIChE J. 48 ( -2570

doi:10.1016/s1359-4311(03)00141-8
fatcat:w22ikccnznb7zp5ypiptaefj3y
*for*solving multipurpose scheduling*problems*is proved to be appropriate*for*the representation of both ... scheduling*problems*and the corresponding heat exchanger network synthesis*problem*. ...*Bounding*step of the procedure The*bounding*step of the procedure tests the feasibility of a partial*problem*and then determines a lower*bound**for*the utility cost. ...##
###
Optimal Space and Time for Streaming Pattern Matching
[article]

2021
*
arXiv
*
pre-print

In this

arXiv:2107.04660v1
fatcat:wbiyvoxvdfbytpfquzgb5awzbi
*streaming*model, we have random access to one string and*streaming*access to the other one. We present*streaming*algorithms with provable guarantees*for*these three fundamental*problems*. ... In addition to this, we present algorithms*for*wildcard pattern matching in the asymmetric*streaming*model that have optimal space and*time*. ...*For*any ǫ > 0, there exists an asymmetric*streaming*algorithm*for*LCS that approximate the solution of LCS within a factor 1 − ǫ in O(log n/ǫ) rounds with memory O(1/ǫ) and its overall runtime is*bounded*...##
###
Page 1001 of The Journal of the Operational Research Society Vol. 60, Issue 7
[page]

2009
*
The Journal of the Operational Research Society
*

N Madhushini et a4+—Branch-and-

*bound*algorithms in permutation flowshops 1001 Table 5 Computational experience with the proposed branch-and-*bound*algorithm*for*the permutation flowshop scheduling*problem*... Note that these 10*problem*instances considered are not successively generated with the use of pseudo-random number*streams*and the corresponding antithetic pseudo-random number*streams*. ...##
###
Adapting parallel algorithms to the W-Stream model, with applications to graph problems

2010
*
Theoretical Computer Science
*

In this paper we show how parallel algorithms can be turned into efficient

doi:10.1016/j.tcs.2010.08.030
fatcat:zj6zuhg2jbgfzdxkp747w5wfja
*streaming*algorithms*for*several classical combinatorial*problems*in the W-*Stream*model. ...*For*other*problems*, most notably graph*problems*, however, this technique leads to suboptimal algorithms. ... the same*time**bounds*, and thus cannot lead to better W-*Stream*algorithms. ...##
###
Towards a Theory of Parameterized Streaming Algorithms
[article]

2019
*
arXiv
*
pre-print

*For*example, the latter shows how to refine the Ω(n^2) bit lower

*bound*

*for*finding a minimum Vertex Cover (VC) in the

*streaming*setting by designing an algorithm

*for*the parameterized k-VC

*problem*which ... Given this success with the

*TIME*resource, it seems but natural to use this approach

*for*dealing with the SPACE resource. ... Acknowledgements We thank MohammadTaghi Hajiaghayi, Robert Krauthgamer and Morteza Monemizadeh

*for*helpful discussions. Algorithm 1 was suggested to us by Arnold Filtser. ...

« Previous

*Showing results 1 — 15 out of 372,366 results*