66 search results - page 1 / 14 » Computing Order Statistics in the Farey Sequence |
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We present the rst sublinear-time algorithms for computing order statistics in the Farey sequence and for the related problem of ranking. Our algorithms achieve a running times o...
ACL
2012
11 years 7 months ago
2012
Reordering is a difficult task in translating between widely different languages such as Japanese and English. We employ the postordering framework proposed by (Sudoh et al., 201...
CVPR
2008
IEEE
14 years 6 months ago
2008
IEEE
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
ALMOB
2006
13 years 4 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...