— The stiffness modeling for a compliant parallel manipulator (CPM) is very important since it provides a basis for the characterization of static, modal, and dynamic behavior of...
In this paper, we present a novel approach for tuning power modes of wireless network interfaces. We use K-means and simple correlation techniques to analyze user's interacti...
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
A single logical entity can be referred to by several different names over a large text corpus. We present our algorithm for finding all suchco-reference sets in a large corpus. Ou...
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...