Results 1  10
of
220,503
QUANTUM ORTHOGONAL PLANES:
, 1997
"... We construct differential calculi on multiparametric quantum orthogonal planes in any dimension N. These calculi are bicovariant under the action of the full inhomogeneous (multiparametric) quantum group ISOq,r(N), and do contain dilatations. If we require bicovariance only under the quantum orthogo ..."
Abstract
 Add to MetaCart
We construct differential calculi on multiparametric quantum orthogonal planes in any dimension N. These calculi are bicovariant under the action of the full inhomogeneous (multiparametric) quantum group ISOq,r(N), and do contain dilatations. If we require bicovariance only under the quantum
PLÜCKERTYPE RELATIONS FOR ORTHOGONAL PLANES
, 2003
"... Abstract. We explore a Plückertype relation which occurs naturally in the study of maximally supersymmetric solutions of certain supergravity theories. This relation generalises at the same time the classical Plücker relation and the Jacobi identity for a metric Lie algebra and coincides with the J ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
with the Jacobi identity of a metric nLie algebra. In low dimension we present evidence for a geometric characterisation of the relation in terms of middledimensional orthogonal planes in euclidean or lorentzian inner product spaces.
TITLE: A Modified Orthogonalized Plane Wave Method for
, 1967
"... This thesis describes some modifications to the orthogonalized plane wave method designed to make the method applicable to calculating the band structure of transition metals. The procedure is to augment the basis ..."
Abstract
 Add to MetaCart
This thesis describes some modifications to the orthogonalized plane wave method designed to make the method applicable to calculating the band structure of transition metals. The procedure is to augment the basis
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.
Almgrenminimality of unions of two almost orthogonal planes in R4. preprint
, 2011
"... In this article we prove that the union of two almost orthogonal planes in R4 is Almgrenminimal. This gives an example of a one parameter family of minimal cones, which is a phenomenon that does not exist in R3. This work is motivated by an attempt to classify the singularities of 2dimensional Alm ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
In this article we prove that the union of two almost orthogonal planes in R4 is Almgrenminimal. This gives an example of a one parameter family of minimal cones, which is a phenomenon that does not exist in R3. This work is motivated by an attempt to classify the singularities of 2dimensional
A Lightweight SLAM algorithm using Orthogonal Planes for Indoor Mobile Robotics
"... Abstract — Simple, fast and lightweight SLAM algorithms are necessary in many embedded robotic systems which soon will be used in houses and offices in order to do various service tasks. In this paper the Orthogonal SLAM algorithm is presented as an answer to this need. In continuation of our previo ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
environments. This is done by mapping only planes that are parallel or perpendicular to each other which represent the main structure of most indoor environments. Having this assumption, we use an inclined sensor setup (fixed 2D SICK laser range finders) to generate 3D orthogonal maps. The algorithm
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
GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems
 SIAM J. SCI. STAT. COMPUT
, 1986
"... We present an iterative method for solving linear systems, which has the property ofminimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the Arnoldi process for constructing an l2orthogonal basis of Krylov subspaces. It can be considered a ..."
Abstract

Cited by 2046 (40 self)
 Add to MetaCart
We present an iterative method for solving linear systems, which has the property ofminimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the Arnoldi process for constructing an l2orthogonal basis of Krylov subspaces. It can be considered
Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules
, 2002
"... In a recent Physical Review Letters paper, Vicsek et. al. propose a simple but compelling discretetime model of n autonomous agents fi.e., points or particlesg all moving in the plane with the same speed but with dierent headings. Each agent's heading is updated using a local rule based on ..."
Abstract

Cited by 1245 (60 self)
 Add to MetaCart
In a recent Physical Review Letters paper, Vicsek et. al. propose a simple but compelling discretetime model of n autonomous agents fi.e., points or particlesg all moving in the plane with the same speed but with dierent headings. Each agent's heading is updated using a local rule based
Large margin methods for structured and interdependent output variables
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract

Cited by 612 (12 self)
 Add to MetaCart
to accomplish this, we propose to appropriately generalize the wellknown notion of a separation margin and derive a corresponding maximummargin formulation. While this leads to a quadratic program with a potentially prohibitive, i.e. exponential, number of constraints, we present a cutting plane algorithm
Results 1  10
of
220,503