1213 search results - page 52 / 243 » Finding patterns in the fieldwork |
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
107
Voted
COMBINATORICS
2002
15 years 26 days ago
2002
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
CHI
1992
ACM
15 years 5 months ago
1992
ACM
We studied CAD system users to find out how they use the sophisticated customization and extension facilities offered by many CAD products. We found that users of varying levels o...
121
Voted
HICSS
2009
IEEE
15 years 4 months ago
2009
IEEE
This study analyzed rhythm and timing in 18 instant messenger (IM) conversations between one advisor and four graduate students (4 dyads), hypothesizing that individuals would sho...
136
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...