Results 1  10
of
11,431
Design of capacityapproaching irregular lowdensity paritycheck codes
 IEEE TRANS. INFORM. THEORY
, 2001
"... We design lowdensity paritycheck (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the unde ..."
Abstract

Cited by 588 (6 self)
 Add to MetaCart
that the underlying communication channel is symmetric, we prove that the probability densities at the message nodes of the graph possess a certain symmetry. Using this symmetry property we then show that, under the assumption of no cycles, the message densities always converge as the number of iterations tends
Closedform solution of absolute orientation using unit quaternions
 J. Opt. Soc. Am. A
, 1987
"... Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. I present here a closedform solution to the leastsquares pr ..."
Abstract

Cited by 989 (4 self)
 Add to MetaCart
Finding the relationship between two coordinate systems using pairs of measurements of the coordinates of a number of points in both systems is a classic photogrammetric task. It finds applications in stereophotogrammetry and in robotics. I present here a closedform solution to the least
Recognitionbycomponents: A theory of human image understanding
 Psychological Review
, 1987
"... The perceptual recognition of objects is conceptualized to be a process in which the image of the input is segmented at regions of deep concavity into an arrangement of simple geometric components, such as blocks, cylinders, wedges, and cones. The fundamental assumption of the proposed theory, recog ..."
Abstract

Cited by 1272 (23 self)
 Add to MetaCart
, recognitionbycomponents (RBC), is that a modest set of generalizedcone components, called geons (N ^ 36), can be derived from contrasts of five readily detectable properties of edges in a twodimensional image: curvature, collinearity, symmetry, parallelism, and cotermmation. The detection
Emergent Quantum Mechanics and Emergent Symmetries, Presented at the 13
 th International Symposium on Particles, Strings and Cosmology (PASCOS
, 2007
"... Quantum mechanics is ‘emergent ’ if a statistical treatment of large scale phenomena in a locally deterministic theory requires the use of quantum operators. These quantum operators may allow for symmetry transformations that are not present in the underlying deterministic system. Such theories allo ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Quantum mechanics is ‘emergent ’ if a statistical treatment of large scale phenomena in a locally deterministic theory requires the use of quantum operators. These quantum operators may allow for symmetry transformations that are not present in the underlying deterministic system. Such theories
A new maximally supersymmetric background of IIB superstring theory
, 2001
"... We present a maximally supersymmetric IIB string background. The geometry is that of a conformally flat lorentzian symmetric space G/K with solvable G, with a homogeneous fiveform flux. We give the explicit supergravity solution, compute the isometries, the 32 Killing spinors, and the symmetry supe ..."
Abstract

Cited by 405 (27 self)
 Add to MetaCart
We present a maximally supersymmetric IIB string background. The geometry is that of a conformally flat lorentzian symmetric space G/K with solvable G, with a homogeneous fiveform flux. We give the explicit supergravity solution, compute the isometries, the 32 Killing spinors, and the symmetry
Branchandprice: Column generation for solving huge integer programs
 OPER. RES
, 1998
"... We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branchandbound tree. We present classes of models for which t ..."
Abstract

Cited by 360 (13 self)
 Add to MetaCart
We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branchandbound tree. We present classes of models for which
Computing Discrete Minimal Surfaces and Their Conjugates
 EXPERIMENTAL MATHEMATICS
, 1993
"... We present a new algorithm to compute stable discrete minimal surfaces bounded by a number of fixed or free boundary curves in R³, S³ and H³. The algorithm makes no restriction on the genus and can handle singular triangulations. For a discrete harmonic map a conjugation process is presented leading ..."
Abstract

Cited by 347 (10 self)
 Add to MetaCart
We present a new algorithm to compute stable discrete minimal surfaces bounded by a number of fixed or free boundary curves in R³, S³ and H³. The algorithm makes no restriction on the genus and can handle singular triangulations. For a discrete harmonic map a conjugation process is presented
SymmetryBreaking Predicates for Search Problems
, 1996
"... Many reasoning and optimization problems exhibit symmetries. Previous work has shown how special purpose algorithms can make use of these symmetries to simplify reasoning. We present a general scheme whereby symmetries are exploited by adding "symmetrybreaking" predicates to the the ..."
Abstract

Cited by 198 (1 self)
 Add to MetaCart
Many reasoning and optimization problems exhibit symmetries. Previous work has shown how special purpose algorithms can make use of these symmetries to simplify reasoning. We present a general scheme whereby symmetries are exploited by adding "symmetrybreaking" predicates
Zeroes of Zeta Functions and Symmetry
, 1999
"... Hilbert and Polya suggested that there might be a natural spectral interpretation of the zeroes of the Riemann Zeta function. While at the time there was little evidence for this, today the evidence is quite convincing. Firstly, there are the “function field” analogues, that is zeta functions of cur ..."
Abstract

Cited by 175 (2 self)
 Add to MetaCart
and its generalizations give striking evidence for such a spectral connection. Moreover, the lowlying zeroes of various families of zeta functions follow laws for the eigenvalue distributions of members of the classical groups. In this paper we review these developments. In order to present the material
G.H.: Optimal orientation detection of linear symmetry
 In: Proceedings of the IEEE First International Conference on Computer Vision, London, Great Britain
, 1987
"... The problem of optimal detection of orientation in arbitrary neighborhoods is solved in the least squares sense. It is shown that this corresponds to fitting an axis in the Fourier domain of the ndimensional neighborhood, the solution of which is a well known solution of a matrix eigenvalue problem ..."
Abstract

Cited by 182 (27 self)
 Add to MetaCart
transformation. An implementation for 2D is presented. Two certainty measures are given corresponding to the orientation estimate. These are the relative or the absolute distances between the two eigenvalues, revealing whether the fitted axis is much better than an axis orthogonal to it. The result
Results 1  10
of
11,431