Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Raphaël Clifford"'
Publikováno v:
Theory of Computing. 15:1-31
We give tight cell-probe bounds for the time to compute convolution, multiplication and Hamming distance in a stream. The cell probe model is a particularly strong computational model and subsumes, for example, the popular word RAM model. • We firs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf21257c5f03921f1f2ebd46b8fc95e3
https://doi.org/10.4086/toc.2019.v015a002
https://doi.org/10.4086/toc.2019.v015a002
Autor:
Peter Clifford, Raphaël Clifford
Publikováno v:
SODA
We study the classical complexity of the exact Boson Sampling problem where the objective is to produce provably correct random samples from a particular quantum mechanical distribution. The computational framework was proposed in STOC '11 by Aaronso
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d48cf738f2b0568700e09e4ec681adb9
https://doi.org/10.1137/1.9781611975031.10
https://doi.org/10.1137/1.9781611975031.10
Publikováno v:
Theoretical Computer Science. 483:68-74
We present space lower bounds for online pattern matching under a number of different distance measures. Given a pattern of length m and a text that arrives one character at a time, the online pattern matching problem is to report the distance betwee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93bf8d18c615285425eab3798517cfd5
https://doi.org/10.1016/j.tcs.2012.06.012
https://doi.org/10.1016/j.tcs.2012.06.012
An Assessment of Models which use Satellite Data to Estimate Solar Irradiance at the Earth's Surface
Autor:
Raphael, Clifford, Hay, John E.
Publikováno v:
Journal of Climate and Applied Meteorology, 1984 May 01. 23(5), 832-844.
Externí odkaz:
https://www.jstor.org/stable/26181357
Autor:
Peter Clifford, Raphaël Clifford
We present a simple and fast deterministic solution to the string matching with don't cares problem. The task is to determine all positions in a text where a pattern occurs, allowing both pattern and text to contain single character wildcards. Our al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::257e7545de2329c8963ffdd558ada636
https://doi.org/10.1016/j.ipl.2006.08.002
https://doi.org/10.1016/j.ipl.2006.08.002
Publikováno v:
String Processing and Information Retrieval ISBN: 9783319460482
SPIRE
SPIRE
We consider dynamic and online variants of 2D pattern matching between an \(m \times m\) pattern and an \(n \times n\) text. All the algorithms we give are randomised and give correct outputs with at least constant probability.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b69d7df0cd6349f82cee28da187b8198
https://doi.org/10.1007/978-3-319-46049-9_13
https://doi.org/10.1007/978-3-319-46049-9_13
Publikováno v:
Information and Computation. 214:112-118
We reconsider the well-known problem of pattern matching under the Hamming distance. Previous approaches have shown how to count the number of mismatches efficiently, especially when a bound is known for the maximum Hamming distance. Our interest is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce8418c7c043dbab5c4f82b5015db41f
https://doi.org/10.1016/j.ic.2012.02.007
https://doi.org/10.1016/j.ic.2012.02.007
Autor:
Raphaël Clifford, Benjamin Sach
Publikováno v:
Information Processing Letters. 110:1012-1015
We consider the combination of function and permuted matching, each of which has fast solutions in their own right. Given a pattern p of length m and a text t of length n, a function match at position i of the text is a mapping f from @S"p to @S"t wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99eeb626c0590dbddef1eda800f538a2
https://doi.org/10.1016/j.ipl.2010.08.017
https://doi.org/10.1016/j.ipl.2010.08.017
Autor:
Ely Porat, Raphaël Clifford
Publikováno v:
Information Processing Letters. 110:1021-1025
We present a filtering based algorithm for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care symbols in either p or t (but not both), and a bound k, our algorithm finds al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87c04d3cd26c8dffdb3b20dcec165d5a
https://doi.org/10.1016/j.ipl.2010.08.012
https://doi.org/10.1016/j.ipl.2010.08.012
Publikováno v:
Journal of Computer and System Sciences. 76(2):115-124
We present solutions for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care symbols and a bound k, our algorithms find all the places that the pattern matches the text with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f77e3fafc77914cdddcb44543efc052b