Results 1  10
of
491,063
Partitioning points by parallel planes
 Rutgers Center for
, 2002
"... A new upper bound is given on the number of ways in which a set of N points in R n can be partitioned by k parallel hyperplanes. This bound improves upon a result of Olafsson and AbuMostafa [IEEE Trans. Pattern Analysis and Machine Intelligence 10(2), 1988: 277281]; it agrees with the known (tight ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A new upper bound is given on the number of ways in which a set of N points in R n can be partitioned by k parallel hyperplanes. This bound improves upon a result of Olafsson and AbuMostafa [IEEE Trans. Pattern Analysis and Machine Intelligence 10(2), 1988: 277281]; it agrees with the known
Symmetry and Related Properties via the Maximum Principle
, 1979
"... We prove symmetry, and some related properties, of positive solutions of second order elliptic equations. Our methods employ various forms of the maximum principle, and a device of moving parallel planes to a critical position, and then showing that the solution is symmetric about the limiting plan ..."
Abstract

Cited by 539 (4 self)
 Add to MetaCart
We prove symmetry, and some related properties, of positive solutions of second order elliptic equations. Our methods employ various forms of the maximum principle, and a device of moving parallel planes to a critical position, and then showing that the solution is symmetric about the limiting
Flexible camera calibration by viewing a plane from unknown orientations
, 1999
"... We propose a flexible new technique to easily calibrate a camera. It only requires the camera to observe a planar pattern shown at a few (at least two) different orientations. Either the camera or the planar pattern can be freely moved. The motion need not be known. Radial lens distortion is modeled ..."
Abstract

Cited by 512 (7 self)
 Add to MetaCart
techniques which use expensive equipment such as two or three orthogonal planes, the proposed technique is easy to use and flexible. It advances 3D computer vision one step from laboratory environments to real world use. The corresponding software is available from the author’s Web page.
Modelling of the 3R Motion at NonParallel Planes
"... Abstract. We construct two similar planar mechanisms which have different and nonparallel planes. We build up a new connection between these mentioned mechanisms in this paper. How the motion of a mechanism is carried to another plane without making a difference in mechanism algorithm and some nece ..."
Abstract
 Add to MetaCart
Abstract. We construct two similar planar mechanisms which have different and nonparallel planes. We build up a new connection between these mentioned mechanisms in this paper. How the motion of a mechanism is carried to another plane without making a difference in mechanism algorithm and some
Affine Reconstruction Based on Parallel Plane and Infinity Point
"... Key words: computer vision; affine reconstruction; infinite homography; point at infinity. Abstract. Affine reconstruction is to restore the affine shape of the object. Generally, there are two ways of achieving, one is to determine the plane at infinity, another is to determine the plane homography ..."
Abstract
 Add to MetaCart
homography. Using the homography which had determined the plane at infinity achieve affine reconstruction. In this paper, firstly give out the homography of infinity plane and the algorithm of affine reconstruction, then proved: if the scene contains a set of parallel planes and a infinity point
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 622 (6 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular
Dryad: Distributed DataParallel Programs from Sequential Building Blocks
 In EuroSys
, 2007
"... Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of availa ..."
Abstract

Cited by 730 (27 self)
 Add to MetaCart
Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set
Minimal Surfaces Bounded by Convex Curves in Parallel Planes
 Commentari Mathematici Helvetici
, 1991
"... this paper was supported by research grant DEFG0286ER250125 of the Applied Mathematical Science subprogram of Office of Energy Research, U.S. Department of Energy, and National Science Foundation grant DMS8900285. y ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
this paper was supported by research grant DEFG0286ER250125 of the Applied Mathematical Science subprogram of Office of Energy Research, U.S. Department of Energy, and National Science Foundation grant DMS8900285. y
The Landscape of Parallel Computing Research: A View from Berkeley
 TECHNICAL REPORT, UC BERKELEY
, 2006
"... ..."
Results 1  10
of
491,063