1 Research Group on Artificial Intelligence of the Hungarian Academy of Sciences and University of Szeged, Aradi vértanúk tere 1., H-6720 Szeged, Hungary E-mail: {busarobi, kocsor}@inf.u-szeged.hu 2 Research Group on Artificial Intelligence NPC., Petőfi S. Sgt. 43., H-6725 Szeged, Hungary 3 Applied Intelligence Laboratory Ltd., Petőfi S. Sgt. 43., H-6725 Szeged, Hungary 4 Bioinformatics Group, ...

Suffix trees are the most frequently used data structures in algorithms on words. In this paper, we consider the depth of a compact suffix tree, also known as the PAT tree, under some simple probabilistic assumptions. For a biased memoryless source, we prove that the limiting distribution for the depth in a PAT tree is the same as the limiting distribution for the depth in a PATRICIA trie, even...

The evolution of the Internet and cloud-based technologies have empowered several organizations with capacity to implement large-scale Things (IoT)-based ecosystems, such as Industrial IoT (IIoT). and, by virtue, IIoT, are vulnerable new types threats intrusions because nature their networks. So it is crucial develop Intrusion Detection Systems (IDSs) that can provide security, privacy, integri...

This paper proposes an efficient method of sentence retrieval based on syntactic structure. Collins proposed Tree Kernel to calculate structural similarity. However, structual retrieval based on Tree Kernel is not practicable because the size of the index table by Tree Kernel becomes impractical. We propose more efficient algorithms approximating Tree Kernel: Tree Overlapping and Subpath Set. T...

Parallel tree contraction is an important framework to develop efficient parallel algorithms on trees. Parallel tree contraction gives an appropriate scheduling for parallel computations on trees, and the scheduling brings efficient parallel algorithms to us. While there are many studies for efficient algorithms of parallel tree contraction and implementation of various parallel computations ba...

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...