Filters








105,076 Hits in 5.6 sec

Space Lower Bounds for Online Pattern Matching [chapter]

Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2011 Lecture Notes in Computer Science  
We present space lower bounds for online pattern matching under a number of different distance measures.  ...  In the former case which includes, as an example, pattern matching with character classes, we give Ω(m) bit space lower bounds.  ...  Introduction We combine existing results with new observations to present a survey of space lower bounds for online pattern matching.  ... 
doi:10.1007/978-3-642-21458-5_17 fatcat:obhotgwuandzzkywnsy7a4vtli

Space Lower Bounds for Online Pattern Matching [article]

Raphael Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2011 arXiv   pre-print
We present space lower bounds for online pattern matching under a number of different distance measures.  ...  In the former case which includes, as an example, pattern matching with character classes, we give Omega(m) bit space lower bounds.  ...  Introduction We combine existing results with new observations to present an overview of space lower bounds for online pattern matching.  ... 
arXiv:1106.4412v1 fatcat:rfiitmtbfba2pccq53huc3md6y

Space lower bounds for online pattern matching

Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2013 Theoretical Computer Science  
We present space lower bounds for online pattern matching under a number of different distance measures.  ...  In the former case which includes, as an example, pattern matching with character classes, we give Ω(m) bit space lower bounds.  ...  Introduction We combine existing results with new observations to present a survey of space lower bounds for online pattern matching.  ... 
doi:10.1016/j.tcs.2012.06.012 fatcat:vihdt22zwjfvfhr2ljhhuae2wa

Pattern Matching in Multiple Streams [article]

Raphael Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
2012 arXiv   pre-print
We give almost matching upper and lower space bounds for three distinct pattern matching problems.  ...  In all three cases we also give space lower bounds which show our methods are optimal up to a single logarithmic factor.  ...  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.  ... 
arXiv:1202.3470v2 fatcat:b4oazacdljcwtb74ee7mcvsn3a

Upper and lower bounds for dynamic data structures on strings [article]

Raphael Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya
2018 arXiv   pre-print
We also provide nearly matching upper bounds for most of the problems we consider.  ...  We give both conditional and unconditional lower bounds for variants of exact matching with wildcards, inner product, and Hamming distance computation via a sequence of reductions.  ...  As a result, we get an unconditional lower bound of Ω((log m/ log log m) 2 ) for DynIP. This matches the highest unconditional lower bound known for any dynamic data structure problem.  ... 
arXiv:1802.06545v1 fatcat:m5swelhsvrc6fa4y6v4q2kvxha

Upper and Lower Bounds for Dynamic Data Structures on Strings

Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya, Marc Herbstritt
2018 Symposium on Theoretical Aspects of Computer Science  
We also provide nearly matching upper bounds for most of the problems we consider.  ...  We give both conditional and unconditional lower bounds for variants of exact matching with wildcards, inner product, and Hamming distance computation via a sequence of reductions.  ...  As a result our lower bound of Ω((log m/ log log m) 2 ) for DynIP matches the highest unconditional lower bound known for any dynamic data structure problem.  ... 
doi:10.4230/lipics.stacs.2018.22 dblp:conf/stacs/CliffordGLS18 fatcat:p7fj4i7osbewnnu4yc5hqrcybq

A black box for online approximate pattern matching

Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat
2011 Information and Computation  
We present a deterministic black box solution for online approximate matching.  ...  The space overhead is linear in the pattern size, which we show is optimal for any deterministic algorithm.  ...  Acknowledgment The authors thank Inbok Lee and Ashley Montanaro for their helpful comments on a draft of this paper.  ... 
doi:10.1016/j.ic.2010.12.007 fatcat:5ybfqmuhxbd5xoeeh6ok2xbfzy

Mind the Gap [article]

Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
2015 arXiv   pre-print
We also provide matching upper-bounds (up to sub-polynomial factors) for the vertex-triangles problem, and then extend these techniques to the online DMOG problem.  ...  Preprocess a dictionary D of d patterns, where each pattern contains a special gap symbol that can match any string, so that given a text that arrives online, a character at a time, we can report all of  ...  The Upper Bound Story Given Theorems 1, 2, and 3, we focus on providing matching upper bounds for the online versions of the vertex-triangles problem, ISG, and DMOG.  ... 
arXiv:1503.07563v2 fatcat:fuy2e5ftenbazme22dsluitohu

Data Structure Lower Bounds for Document Indexing Problems [article]

Peyman Afshani, Jesper Sindahl Nielsen
2016 arXiv   pre-print
Often our lower bounds match the known space-query time trade-off curve and in fact for all the problems considered, there is a very good and reasonable match between the our lower bounds and the known  ...  upper bounds, at least for some choice of input parameters.  ...  We thank Karl Bringmann for simplifying the construction of our documents for the 2P problem. We thank Moshe Lewenstein for bringing the WCI problem to our attention.  ... 
arXiv:1604.06264v1 fatcat:4b56qaqfjfdkxjykcvn73wnery

Error Tree: A Tree Structure for Hamming & Edit Distances & Wildcards Matching [article]

Anas Al-Okaily
2015 arXiv   pre-print
+ 3^kocc) in the average case) query time for edit distance for any online/offline pattern.  ...  + occ) in the average case) of query time for any online/offline pattern, where occ is the number of outputs. As well, a tree structure of O(2^knlog_Σ ^kn/k!) words and O(m^k/k!  ...  + 3 k occ) in the average case) of query time for edit distance and any online/offline pattern.  ... 
arXiv:1506.04486v1 fatcat:atnw6j4q4bhvjacrmfg3oyct5a

Online k-Way Matching with Delays and the H-Metric [article]

Darya Melnyk, Yuyi Wang, Roger Wattenhofer
2021 arXiv   pre-print
In this paper, we study k-Way Min-cost Perfect Matching with Delays - the k-MPMD problem. This problem considers a metric space with n nodes. Requests arrive at these nodes in an online fashion.  ...  The task is to match these requests into sets of exactly k, such that the space and time cost of all matched requests are minimized.  ...  Acknowledgments We would like to thank Tim Bohren and Kyriakis Panagiotis for their valuable input on the H-metric.  ... 
arXiv:2109.06640v1 fatcat:af2u7k6uvbao7c4hdwpfmu4u7m

New Bounds for Variable-Sized Online Bin Packing

Steven S. Seiden, Rob van Stee, Leah Epstein
2003 SIAM journal on computing (Print)  
We present new algorithms for this problem and show upper bounds for them which improve on the best previous upper bounds. We also show the first general lower bounds for this problem.  ...  In the variable-sized online bin packing problem, one has to assign items to bins one by one.  ...  We now consider the question of lower bounds. Prior to this work, no general lower bounds for variable-sized online bin packing were known.  ... 
doi:10.1137/s0097539702412908 fatcat:j5gd6dyce5e7fe4fczldqv3z2q

Lower Bound on Scattered Power from Antennas

Behrooz Semnani, Amir Borji
2012 IEEE Antennas and Wireless Propagation Letters  
A lower bound on the total power scattered from a lossless and matched receiving antenna, for a given incident wave, is presented.  ...  our predicted lower bound.  ...  In Section III, a lower bound on the total power scattered by a lossless and matched antenna with a prescribed complex radiation pattern is derived.  ... 
doi:10.1109/lawp.2012.2192709 fatcat:vlc3p542pffi5aq3cpssu2ikny

Scalable Similarity Matching in Streaming Time Series [chapter]

Alice Marascu, Suleiman A. Khan, Themis Palpanas
2012 Lecture Notes in Computer Science  
One major problem in this area is the online identification of streaming sequences similar to a predefined set of pattern-sequences.  ...  We propose the first online similarity matching algorithm based on Longest Common SubSequence that is specifically designed to operate in a streaming context, and that can effectively handle time scaling  ...  This study proposes a technique, where the patterns to be matched are first hierarchically clustered based on their minimum bounding envelopes.  ... 
doi:10.1007/978-3-642-30220-6_19 fatcat:zbi3htntafcy7h2sazuy3prjay

Fast Matching for All Pairs Similarity Search

Amit Awekar, Nagiza F. Samatova
2009 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology  
Many real-world systems like search engines, online social networks, and digital libraries frequently have to solve this problem for datasets having millions of records in a high dimensional space, which  ...  Within this framework, we propose fast matching technique that uses the sparse nature of real-world data to effectively reduce the size of the search space through a systematic set of tighter filtering  ...  Acknowledgments We thank Paul Breimyer of NCSU for thoughtful comments and suggestions. This work is performed as part of the Scientific Data Management Center  ... 
doi:10.1109/wi-iat.2009.52 dblp:conf/webi/AwekarS09 fatcat:mndwwozclza6bco6zqf2adwsq4
« Previous Showing results 1 — 15 out of 105,076 results