Results 1  10
of
1,509
On an extremal problem concerning primitive sequences
 J. London Math. Soc
, 1967
"... A sequence a,<... of integers is called primitive if no a divides any other. (a 1 <... will always denote a primitive sequence.) It is easy to see that if a i <... < a,,, < n then max k = [(n + 1) /2]. The following question seems to be very much more difficult. Put f(n) =niax E 1), a ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
A sequence a,<... of integers is called primitive if no a divides any other. (a 1 <... will always denote a primitive sequence.) It is easy to see that if a i <... < a,,, < n then max k = [(n + 1) /2]. The following question seems to be very much more difficult. Put f(n) =niax E 1
THEOREM 1. Let A be an infinite Primitive sequence. Then
, 1965
"... A sequence of integers 0 < a 1 < a 2 <... no term of which divides any other will be called a primitive sequence. Throughout this paper Cl, c 2, • • • will denote suitable positive absolute constants. Behrend [1] proved that for every primitive sequence ..."
Abstract
 Add to MetaCart
A sequence of integers 0 < a 1 < a 2 <... no term of which divides any other will be called a primitive sequence. Throughout this paper Cl, c 2, • • • will denote suitable positive absolute constants. Behrend [1] proved that for every primitive sequence
primitive sequences modulo squarefree
, 2011
"... the distinctness of binary sequences derived from ..."
Primitive Sequences in General Purpose Forth Programs
 In Proceedings of the 18th EuroForth European Conference on Forth
, 2002
"... running time of Forth interpreters, especially on modern pipelined processors. Superinstructions are an important optimisation to reduce the number of instruction dispatches. Superinstructions have been used for many years to optimise interpreters, but an open problem is the choice of superinstructi ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
running time of Forth interpreters, especially on modern pipelined processors. Superinstructions are an important optimisation to reduce the number of instruction dispatches. Superinstructions have been used for many years to optimise interpreters, but an open problem is the choice of superinstructions to include in the interpreter. In this paper we propose a number of heuristics for choosing superinstructions, and evaluate them for general purpose Forth programs. We find that static measures of frequency perform well for superinstruction selection. As few as eight superinstructions can reduce the number of instruction dispatches by an average of 15%, and reductions of up to 45% are possible with large numbers of superinstructions.
Classical results on primitive and recent results on crossprimitive sequences
 SFB 343 &QUOT;DISKRETE STRUKTUREN IN DER MATHEMATIK &QUOT;, BIELEFELD, PREPRINT 93042
, 1993
"... ..."
DISTRIBUTION OF RPATTERNS IN THE KERDOCKCODE BINARY SEQUENCES AND THE HIGHEST LEVEL SEQUENCES OF PRIMITIVE SEQUENCES OVER Z 2 l
"... Abstract. The distribution of rpatterns is an important aspect of pseudorandomness for periodic sequences over finite field.The aim of this work is to study the distribution of rpatterns in the Kerdockcode binary sequences and the highest level sequences of primitive sequences over Z 2 l.By combi ..."
Abstract
 Add to MetaCart
Abstract. The distribution of rpatterns is an important aspect of pseudorandomness for periodic sequences over finite field.The aim of this work is to study the distribution of rpatterns in the Kerdockcode binary sequences and the highest level sequences of primitive sequences over Z 2 l
Distribution Of RPatterns In The KerdockCode Binary Sequences And The Highest Level Sequences Of Primitive Sequences Over...
, 2004
"... The distribution of rpatterns is an important aspect of pseudorandomness for periodic sequences over finite field.The aim of this work is to study the distribution of rpatterns in the Kerdockcode binary sequences and the highest level sequences of primitive sequences over Z 2 l .By combining the ..."
Abstract
 Add to MetaCart
The distribution of rpatterns is an important aspect of pseudorandomness for periodic sequences over finite field.The aim of this work is to study the distribution of rpatterns in the Kerdockcode binary sequences and the highest level sequences of primitive sequences over Z 2 l .By combining
Learning and Recognizing Human Dynamics in Video Sequences
, 1997
"... This paper describes a probabilistic decomposition of human dynamics at multiple abstractions, and shows how to propagate hypotheses across space, time, and abstraction levels. Recognition in this framework is the succession of very general low level grouping mechanisms to increased specific and lea ..."
Abstract

Cited by 356 (2 self)
 Add to MetaCart
and learned model based grouping techniques at higher levels. Hard decision thresholds are delayed and resolved by higher level statistical models and temporal context. Lowlevel primitives are areas of coherent motion found by EM clustering, midlevel categories are simple movements represented by dynamical
Results 1  10
of
1,509