Results 1  10
of
228,533
Prioritized sweeping: Reinforcement learning with less data and less time
 Machine Learning
, 1993
"... We present a new algorithm, Prioritized Sweeping, for e cient prediction and control of stochastic Markov systems. Incremental learning methods such asTemporal Di erencing and Qlearning have fast real time performance. Classical methods are slower, but more accurate, because they make full use of ..."
Abstract

Cited by 379 (6 self)
 Add to MetaCart
We present a new algorithm, Prioritized Sweeping, for e cient prediction and control of stochastic Markov systems. Incremental learning methods such asTemporal Di erencing and Qlearning have fast real time performance. Classical methods are slower, but more accurate, because they make full use
Xmeans: Extending Kmeans with Efficient Estimation of the Number of Clusters
 In Proceedings of the 17th International Conf. on Machine Learning
, 2000
"... Despite its popularity for general clustering, Kmeans suffers three major shortcomings; it scales poorly computationally, the number of clusters K has to be supplied by the user, and the search is prone to local minima. We propose solutions for the first two problems, and a partial remedy for the t ..."
Abstract

Cited by 417 (5 self)
 Add to MetaCart
Despite its popularity for general clustering, Kmeans suffers three major shortcomings; it scales poorly computationally, the number of clusters K has to be supplied by the user, and the search is prone to local minima. We propose solutions for the first two problems, and a partial remedy
Sweeping Minimum Perimeter Enclosing Parallelograms: Optimal Crumb Cleanup
"... We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vectors. We characterize the optimal 2sweeps of triangles, and provide a lineartime algorithm for convex polygons. 1 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vectors. We characterize the optimal 2sweeps of triangles, and provide a lineartime algorithm for convex polygons. 1
A SpaceSweep Approach to True Multi Image Matching
, 1995
"... The problem of determining feature correspondences across multiple views is considered. The term "true multiimage " matching is introduced to describe techniques that make full and efficient use of the geometric relationships between multiple images and the scene. A true multiimage techn ..."
Abstract

Cited by 221 (3 self)
 Add to MetaCart
The problem of determining feature correspondences across multiple views is considered. The term "true multiimage " matching is introduced to describe techniques that make full and efficient use of the geometric relationships between multiple images and the scene. A true multi
Sweeping points ∗
, 2009
"... Given a set of points in the plane, and a sweepline as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweepline is placed at a start position somewhere in the plane, then moved orthogonally and continuously to another parallel end position ..."
Abstract
 Add to MetaCart
Given a set of points in the plane, and a sweepline as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweepline is placed at a start position somewhere in the plane, then moved orthogonally and continuously to another parallel end
On minimal perimeter polyminoes
 In The 13th International Conference on Discrete Geometry for Computer Imagery (DGCI2006
, 2006
"... Abstract. This paper explores proofs of the isoperimetric inequality for 4connected shapes on the integer grid Z2, and its geometric meaning. Pictorially, we discuss ways to place a maximal number unit square tiles on a chess board so that the shape they form has a minimal number of unit square nei ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. This paper explores proofs of the isoperimetric inequality for 4connected shapes on the integer grid Z2, and its geometric meaning. Pictorially, we discuss ways to place a maximal number unit square tiles on a chess board so that the shape they form has a minimal number of unit square neighbors. Previous works have shown that “digital spheres” have a minimum of neighbors for their area. We here characterize all shapes that are optimal and show that they are all close to being digital spheres. In addition, we show a similar result when the 8connectivity metric is assumed (i.e. connectivity through vertices or edges, instead of edge connectivity as in 4connectivity). 1
Distributed partitioning strategies for perimeter patrolling
 In American Control Conference, 4026–4031
, 2011
"... Abstract — In this work we study the problem of realtime optimal distributed partitioning for perimeter patrolling in the context of multicamera networks for surveillance. The objective is to partition a line of fixed length into nonoverlapping segments, each assigned to a different camera to pat ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract — In this work we study the problem of realtime optimal distributed partitioning for perimeter patrolling in the context of multicamera networks for surveillance. The objective is to partition a line of fixed length into nonoverlapping segments, each assigned to a different camera
Sweeping an oval to a vanishing point
, 2011
"... Given a convexregion in the plane, and a sweepline as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by orthogonal sweepswasfirststudiedin[2]. Hereweconsiderthefollowingslanted variantofsweepingrecently introduced in [1]: In a ..."
Abstract
 Add to MetaCart
Given a convexregion in the plane, and a sweepline as a tool, what is best way to reduce the region to a single point by a sequence of sweeps? The problem of sweeping points by orthogonal sweepswasfirststudiedin[2]. Hereweconsiderthefollowingslanted variantofsweepingrecently introduced in [1
Multiagent perimeter patrolling subject to mobility constraints
 In American Control Conference
, 2012
"... Abstract — In this paper we study the problem of realtime optimal distributed partitioning for perimeter patrolling in the context of multicamera networks for surveillance. The objective is to partition a given segment into nonoverlapping subsegments, each assigned to a different camera to patro ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract — In this paper we study the problem of realtime optimal distributed partitioning for perimeter patrolling in the context of multicamera networks for surveillance. The objective is to partition a given segment into nonoverlapping subsegments, each assigned to a different camera
Results 1  10
of
228,533