Sciweavers

31 search results - page 4 / 7
» cpm 2006
Sort
View
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
15 years 4 months ago
Stiffness Modeling of a Spatial 3-DOF Compliant Parallel Micromanipulator
— 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...
Qingsong Xu, Yangmin Li
AAAI
2006
14 years 11 months ago
CPM: Context-Aware Power Management in WLANs
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...
Fahd Albinali, Chris Gniady
103
Voted
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
15 years 1 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
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...
Alexandre Tiskin
78
Voted
CPM
2006
Springer
140views Combinatorics» more  CPM 2006»
15 years 1 months ago
Identifying Co-referential Names Across Large Corpora
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...
Levon Lloyd, Andrew Mehler, Steven Skiena
101
Voted
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
15 years 1 months ago
On-Line Linear-Time Construction of Word Suffix Trees
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 ...
Shunsuke Inenaga, Masayuki Takeda