Optimal parallel analysis and decomposition of partially occluded strings

Parallel Computing - Tập 26 - Trang 483-494 - 2000
Costas S. Iliopoulos1,2, James F. Reid1,3
1Algorithm Design Group, Department of Computer Science, King's College London, London WC2R 2LS, UK
2School of Computing, Curtin University of Technology, Perth, WA 6102, Australia
3Dipt. di Elettronica e Informatica, Università degli Studi di Padova, Via Gradenigo 6/A, Padova 35131, Italy

Tài liệu tham khảo

Apostolico, 1991, Optimal superprimitivity testing for strings, Information Processing Letters, 39, 17, 10.1016/0020-0190(91)90056-N

Bischof, 1994, Learning structural descriptions of patterns: a new technique for conditional clustering and rule generation, Pattern Recognition, 27, 689, 10.1016/0031-3203(94)90047-7

Breslauer, 1990, An optimal O(log logn) time parallel string matching algorithm, SIAM Journal of Computing, 19, 1051, 10.1137/0219072

Bunke, 1993, Applications of approximate string matching to 2D shape recognition, Pattern Recognition, 26, 1797, 10.1016/0031-3203(93)90177-X

Duval, 1996, Reducing the size of hybridization chips for DNA sequence analysis, International Journal of Foundations of Computer Science, 7, 87, 10.1142/S0129054196000075

Fich, 1988, Relations between concurrent-write models of parallel computation, SIAM Journal of Computing, 17, 606, 10.1137/0217037

L. Ga̧sieniec, K. Park, Work-time optimal parallel prefix matching, in: Proceedings of the Second European Symposium on Algorithms (ESA'94), Lecture Notes in Computer Science, vol. 855, Springer, Berlin, 1994, pp. 471–482

Geiger, 1995, Occlusions and binocular stereo, International Journal of Computer Vision, 14, 211, 10.1007/BF01679683

K. Hoff, T. Hudson, D. Manocha, H. Zhang, Visibility culling using hierarchical occlusion maps, Computer Graphics Proceedings, Annal Conference Series, Sigraph, 1997, pp. 77–88

Iliopoulos, 1996, Optimal parallel superprimitivity testing on square arrays, Parallel Processing Letters, 6, 299, 10.1142/S0129626496000297

Iliopoulos, 1994, An optimal O(log logn) time algorithm for parallel superprimitivity testing, Journal of the Korea Information Science Society, 21, 1400

C.S. Iliopoulos, J.F. Reid, Validating and decomposing partially occluded two-dimensional images (extended abstract), in: Proceedings of the Third Prague Stringology Club Workshop, PSCW98, Department of Computer Science and Engineering, Czech Technical University, Prague, Czech Republic, 1998

C.S. Iliopoulos, J. Simpson, On-line validation and analysis of occluded images, in: Proceedings of the Eighth Australasian Workshop on Combinatorial Algorithms (AWOCA'97), Research on Combinatorial Algorithms, Queensland University of Technology, 1997, pp. 25–36

Kuzmin, 1996, Visual space geometry derived from occlusion axioms, Journal of Mathematical Imaging and Vision, 6, 291, 10.1007/BF00119844

D.W.G. Moore, W.F. Smyth, Computing the covers of a string in linear time, in: Proceedings of the Fifth ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 511–515

P.A. Pevzner, R.J. Lipshutz, Towards DNA sequencing chips, in: Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 841, Springer, Berlin, 1994, pp. 143–158

Radge, 1993, The parallel simplicity of compaction and chaining, Journal of Algorithms, 14, 371, 10.1006/jagm.1993.1019

Thông tin
Thông tin xuất bản

Parallel Computing

Tập 26

483-494

Thông tin tác giả