暂无分享,去创建一个
[1] Ely Porat,et al. Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications , 2007, CPM.
[2] S. Muthukrishnan,et al. New Results and Open Problems Related to Non-Standard Stringology , 1995, CPM.
[3] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[4] William Rucklidge,et al. Efficient Visual Recognition Using the Hausdorff Distance , 1996, Lecture Notes in Computer Science.
[5] Piotr Indyk,et al. Simple and practical algorithm for sparse Fourier transform , 2012, SODA.
[6] Arnold Schönhage,et al. Schnelle Multiplikation großer Zahlen , 1971, Computing.
[7] Samarjit Chakraborty,et al. Computing Largest Common Point Sets under Approximate Congruence , 2000, ESA.
[8] Richard Cole,et al. Verifying candidate matches in sparse and wildcard matching , 2002, STOC '02.
[9] Joan Antoni Sellarès,et al. Noisy colored point set matching , 2011, Discret. Appl. Math..
[10] Piotr Indyk,et al. Nearly optimal sparse fourier transform , 2012, STOC '12.
[11] Piotr Indyk,et al. Geometric matching under noise: combinatorial bounds and algorithms , 1999, SODA '99.
[12] Dit-Yan Yeung,et al. Bidirectional Deformable Matching with Application to Handwritten Character Extraction , 2002, IEEE Trans. Pattern Anal. Mach. Intell..
[13] Micha Sharir,et al. Hausdorff distance under translation for points and balls , 2003, TALG.
[14] Tatsuya Akutsu,et al. Point matching under non-uniform distortions , 2003, Discret. Appl. Math..
[15] Esko Ukkonen,et al. Sweepline the Music! , 2003, Computer Science in Perspective.
[16] Pedro Berrizbeitia,et al. Sharpening "Primes is in P" for a large family of numbers , 2002, Math. Comput..
[17] David E. Cardoze,et al. Pattern matching for spatial point sets , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[18] Yonatan Aumann,et al. Approximate string matching with address bit errors , 2008, Theor. Comput. Sci..
[19] Damien Stehlé,et al. A Binary Recursive Gcd Algorithm , 2004, ANTS.