The suffix tree is a data structure that has found applications in various important problems, such as genetic sequencing, pattern matching and computational biology. Its derivative data structure, the suffix array, is another representation with the added advantage of a small memory footprint. We propose a simple O(n log n) time divideand-conquer sort-and-merge algorithm for solving the suffix...

Clustering is related to data mining for information retrieval. Relevant information is retrieved quickly while doing the clustering of documents. It organizes the documents into groups; each group contains the documents of similar type content. Different clustering algorithms are used for clustering the documents such as partitioned clustering (K-means Clustering) and Hierarchical Clustering (...

In this paper, we consider a setting where aclient wants to outsource storage of a large amount ofprivate data and then perform substring search querieson the data – given a data string s and a search stringp, find all occurrences of p as a substring of s. First, weformalize an encryption paradigm that we call queryableencryption, which generalizes searchable symmetric e...

Mining Web click streams is an important data mining problem with broad applications. However, it is also a difficult problem since the streaming data possess some interesting characteristics, such as unknown or unbounded length, possibly a very fast arrival rate, inability to backtrack over previously arrived click-sequences, and a lack of system control over the order in which the data arrive...

A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.

Resource scarcity along with diversity– both in dialect and script–are the two primary challenges in Kurdish language processing. In this paper we aim at addressing these two problems by (i) building a text corpus for Sorani and Kurmanji, the two main dialects of Kurdish, and (ii) highlighting some of the orthographic, phonological, and morphological differences between these two dialects from ...

In this paper, we consider a setting where aclient wants to outsource storage of a large amount ofprivate data and then perform substring search querieson the data – given a data string s and a search stringp, find all occurrences of p as a substring of s. First, weformalize an encryption paradigm that we call queryableencryption, which generalizes searchable symmetric e...