Result 1 to 20 of 48 total
Efficient retrieval of approximate palindromes in a run-length encoded string. (English)
Theor. Comput. Sci. 432, 28-37 (2012).
1
Fast algorithms for computing the constrained LCS of run-length encoded strings. (English)
Theor. Comput. Sci. 432, 1-9 (2012).
2
Colour image coding with matching pursuit in the spatio-frequency domain. (English)
Maino, Giuseppe (ed.) et al., Image analysis and processing ‒ ICIAP 2011. 16th international conference, Ravenna, Italy, September 14‒16, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-24084-3/pbk). Lecture Notes in Computer Science 6978, 306-317 (2011).
3
Compression algorithm based on half-length of the binary stream. (CN)
J. Comput. Appl. 31, No. 7, 1856-1858 (2011).
4
Modified run-length encoding method and distance algorithm to classify run-length encoded binary data. (English)
Balasubramaniam, P. (ed.), Control, computation and information systems. First international conference on logic, information, control and computation, ICLICC 2011, Gandhigram, India, February 25‒27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19262-3/pbk; 978-3-642-19263-0/ebook). Communications in Computer and Information Science 140, 271-280 (2011).
5
Distinct squares in run-length encoded strings. (English)
Theor. Comput. Sci. 411, No. 49, 4235-4241 (2010).
6
A run-based one-and-a-half-scan connected-component labeling algorithm. (English)
Int. J. Pattern Recognit. Artif. Intell. 24, No. 4, 557-579 (2010).
7
Fast distance transformation on irregular two-dimensional grids. (English)
Pattern Recognition 43, No. 10, 3348-3358 (2010).
8
Hardness of comparing two run-length encoded strings. (English)
J. Complexity 26, No. 4, 364-374 (2010).
9
A fast level set framework for large three-dimensional topography simulations. (English)
Comput. Phys. Commun. 180, No. 8, 1242-1250 (2009).
10
Alignment of minisatellite maps based on run-length encoding scheme. (English)
J. Bioinform. Comput. Biol. 7, No. 2, 287-308 (2009).
11
Adaptive high capacity RLE image data hiding method. (English)
Far East J. Exp. Theor. Artif. Intell. 4, No. 2, 147-159 (2009).
12
RLH: bitmap compression technique based on run-length and Huffman encoding. (English)
Inf. Syst. 34, No. 4-5, 400-414 (2009).
13
Dynamic rank/select structures with applications to run-length encoded texts. (English)
Theor. Comput. Sci. 410, No. 43, 4402-4413 (2009).
14
A fast algorithm for finding the positions of all squares in a run-length encoded string. (English)
Theor. Comput. Sci. 410, No. 38-40, 3942-3948 (2009).
15
A run-based one-scan labeling algorithm. (English)
Kamel, Mohamed (ed.) et al., Image analysis and recognition. 6th international conference, ICIAR 2009, Halifax, Canada, July 6‒8, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02610-2/pbk). Lecture Notes in Computer Science 5627, 93-102 (2009).
16
Approximate matching for run-length encoded strings is {\sc 3sum}-hard. (English)
Kucherov, Gregory (ed.) et al., Combinatorial pattern matching. 20th annual symposium, CPM 2009, Lille, France, June 22‒24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02440-5/pbk). Lecture Notes in Computer Science 5577, 168-179 (2009).
17
Edit distance for a run-length-encoded string and an uncompressed string. (English)
Inf. Process. Lett. 105, No. 1, 12-16 (2008).
18
Optimization and application of connected component labeling algorithm based on run-length encoding. (Chinese)
J. Comput. Appl. 28, No. 12, 3150-3153 (2008).
19
MPI reduction operations for sparse floating-point data. (English)
Lastovetsky, Alexey (ed.) et al., Recent advances in parallel virtual machine and message passing interface. 15th European PVM/MPI users’ group meeting, Dublin, Ireland, September 7‒10, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87474-4/pbk). Lecture Notes in Computer Science 5205, 94-101 (2008).
20
Result 1 to 20 of 48 total
Start
Contact
Print
General Help
