Results 1  10
of
9,013
THE FELINE JOSEPHUS PROBLEM
"... Abstract. In the classic Josephus problem, elements 1, 2,..., n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consists of traveling around the circle from the current position, and selecting the kth remaining element to be elimin ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In the classic Josephus problem, elements 1, 2,..., n are placed in order around a circle and a skip value k is chosen. The problem proceeds in n rounds, where each round consists of traveling around the circle from the current position, and selecting the kth remaining element
The Feline Josephus Problem
"... 60 61 62 63 64 65 Theory of Computing Systems manuscript No. (will be inserted by the editor) ..."
Abstract
 Add to MetaCart
60 61 62 63 64 65 Theory of Computing Systems manuscript No. (will be inserted by the editor)
The PASCAL Visual Object Classes (VOC) challenge
, 2009
"... ... is a benchmark in visual object category recognition and detection, providing the vision and machine learning communities with a standard dataset of images and annotation, and standard evaluation procedures. Organised annually from 2005 to present, the challenge and its associated dataset has be ..."
Abstract

Cited by 624 (20 self)
 Add to MetaCart
... is a benchmark in visual object category recognition and detection, providing the vision and machine learning communities with a standard dataset of images and annotation, and standard evaluation procedures. Organised annually from 2005 to present, the challenge and its associated dataset has become accepted as the benchmark for object detection. This paper describes the dataset and evaluation procedure. We review the stateoftheart in evaluated methods for both classification and detection, analyse whether the methods are statistically different, what they are learning from the images (e.g. the object or its context), and what the methods find easy or confuse. The paper concludes with lessons learnt in the three year history of the challenge, and proposes directions for future improvement and extension.
The Josephus Problem
"... We give explicit nonrecursive formulas to compute the Josephusnumbers j#n; 2;i# and j#n; 3;i# and explicit upper and lower bounds for j#n; k; i# #where k # 4# which di#er by2k,2 #for k = 4 the bounds are even better#. Furthermore we present a new fast algorithm to calculate j#n; k; i# which is bas ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We give explicit nonrecursive formulas to compute the Josephusnumbers j#n; 2;i# and j#n; 3;i# and explicit upper and lower bounds for j#n; k; i# #where k # 4# which di#er by2k,2 #for k = 4 the bounds are even better#. Furthermore we present a new fast algorithm to calculate j#n; k; i# which
The Josephus Problem
 J. Thor. Nombres Bordeaux
, 1997
"... We give explicit nonrecursive formulas to compute the Josephusnumbers j(n; 2; i) and j(n; 3; i) and explicit upper and lower bounds for j(n; k; i) (where k 4) which differ by 2k \Gamma 2 (for k = 4 the bounds are even better). Furthermore we present a new fast algorithm to calculate j(n; k; i) w ..."
Abstract
 Add to MetaCart
) which is based upon the mentioned bounds. 1 Introduction The Josephus problem in its original form goes back to the Roman historian Flavius Josephus (see [3]). In the RomanoJewish conflict of 67 A. D., the Romans took the town Jotapata which Josephus was commanding. He and 40 companions escaped
Parts Of Recognition
 COGNITION
, 1983
"... A complete theory of object recognition is an impossibility not simply because of the multiplicity of visual cues we exploit in elegant coordination to identify an object, but primarily because recognition involves fixation of belief, and anything one knows may be relevant. We finesse this obstacle ..."
Abstract

Cited by 311 (8 self)
 Add to MetaCart
with two moves. The first restricts attention to one visual cue, the shapes of objects; the second restricts attention to one problem, the initial guess at the identity of an object. We propose that the visual system decomposes a shape into parts, that it does so using a rule defining part boundaries
Functional iteration and the Josephus problem
, 1991
"... this paper we deal with the J q (n)'s. What we have to contribute is the observation that in one of the algorithms that has been proposed for solving the problem, the sequence of numbers that is generated is remarkably well approximated by a single term of its asymptotic series. This result, wh ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
this paper we deal with the J q (n)'s. What we have to contribute is the observation that in one of the algorithms that has been proposed for solving the problem, the sequence of numbers that is generated is remarkably well approximated by a single term of its asymptotic series. This result
Josephus Hulshof
, 2005
"... 1 We continue to study a simple integrodifferential equation: the QuasiSteady equation (QS) of flame front dynamics. This second order quasilinear parabolic equation with a nonlocal term is dynamically similar to the KuramotoSivashinsky (KS) equation. In [FGS03], where it was introduced, its w ..."
Abstract
 Add to MetaCart
1 We continue to study a simple integrodifferential equation: the QuasiSteady equation (QS) of flame front dynamics. This second order quasilinear parabolic equation with a nonlocal term is dynamically similar to the KuramotoSivashinsky (KS) equation. In [FGS03], where it was introduced, its wellposedness and proximity for finite time intervals to the KS equation in Sobolev spaces of periodic functions were established. Here we demonstrate that QS possesses a universal absorbing set, and a compact attractor. Furthermore we show that the attractor is of a finite Hausdorff dimension.We discuss relationship with the KuramotoSivashinsky and BurgersSivashinsky equations. 1
Generilizations of the Josephus problem
"... Abstract. This article presents two algorithmic solutions to an extended version of the Josephus problem. In addition, the number of steps required for one of these algorithms is discussed. Finally, a variation on the Josephus problem and an algorithmic solution to this new problem are also given. 1 ..."
Abstract
 Add to MetaCart
Abstract. This article presents two algorithmic solutions to an extended version of the Josephus problem. In addition, the number of steps required for one of these algorithms is discussed. Finally, a variation on the Josephus problem and an algorithmic solution to this new problem are also given
Time Improvement on Josephus Problem
, 2002
"... An algorithm for Josephus Problem has been proposed only the time complexity of O(m+ log m=(m 1) (n=m)). A prealgorithm was used to obtain the best algorithm. By increasing m the algorithm becomes more ecient than the algorithms suggested before. ..."
Abstract
 Add to MetaCart
An algorithm for Josephus Problem has been proposed only the time complexity of O(m+ log m=(m 1) (n=m)). A prealgorithm was used to obtain the best algorithm. By increasing m the algorithm becomes more ecient than the algorithms suggested before.
Results 1  10
of
9,013