76 search results - page 6 / 16 » Linear-Time Ranking of Permutations |
CPM
2005
Springer
14 years 12 days ago
2005
Springer
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
JSYML
2006
13 years 6 months ago
2006
It is shown that, according to NF, many of the assertions of ordinal arithmetic involving the T-function which is peculiar to NF turn out to be equivalent to the truth-in-certain-...
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
ADHOCNOW
2004
Springer
14 years 8 days ago
2004
Springer
We address the question of finding sensors’ coordinates, or at least an approximation of them, when the sensors’ abilities are very weak. In a d dimensional space, we define ...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...