This paper deals with automatic Single View Reconstruction (SVR) of multi-planar scenes characterized by a profusion of straight lines and mutually orthogonal line-pairs. We provide a new shape-from-X constraint based on this regularity of angles between line-pairs in manmade scenes. First, we show how the presence of such regular angles can be used for 2D rectification of an image of a plane. ...

This paper presents a statistically based method for spotting target words in documents. The crux of the method is the representation of a word by a spatial (planar) point process evolving on a regular lattice of coordinate pairs. This is accomplished by extracting the coordinate pairs, i.e. pixel locations, where the binary bitmap values of the word are non-zero. With this representation the w...

In a recent article [Gi99], V.Ginzburg introduced and studied in depth the notion of a principal nilpotent pair in a semisimple Lie algebra g. He also obtained several results for more general pairs. As a next step, we considered in [Pa99] almost principal nilpotent pairs. The aim of this paper is to make a contribution to the general theory of nilpotent pairs. Roughly speaking, a nilpotent pai...

In this paper we study algebraic sets of pairs matrices defined by the vanishing either diagonal their commutator matrix or its anti-diagonal. We find systems parameters for coordinate rings these two and intersection show that they are complete intersections. Moreover, prove F-pure over a field positive prime characteristic set with zero is F-regular.

We give asymptotic upper and lower bounds for the diameter of almost every r-regular graph on n vertices (n~). Though random graphs of various types have been investigated extensively over the last twenty years, random regular graphs have hardly been studied. The reason for this is that until recently there was no formula for the asymptotic number of labelled r-regular graphs of order n. Such a...

Graph navigational languages define binary relations in terms of pair of nodes in a graph subject to the existence of a path satisfying a certain regular expression. The goal of this paper is to give a novel characterization of navigational languages in terms of the structure of the graph embracing the results of a query. We define novel graph-based query evaluation semantics and efficient algo...

Lovász conjectured that every connected 4-regular planar graph G admits a realization as a system of circles, i.e., it can be drawn on the plane utilizing a set of circles, such that the vertices of G correspond to the intersection and touching points of the circles and the edges of G are the arc segments among pairs of intersection and touching points of the circles. In this paper, (a) we affi...

In 1963, Zaretskiùõ established a one-to-one correspondence between the set BX of binary relations on a set X and the set of triples of the form (W,φ, V ) where W and V are certain lattices and φ : W −→ V is an isomorphism. We provide a multiplication for these triples making the Zaretskiùõ correspondence a semigroup isomorphism. In addition, we consider faithful representations of BX by pairs ...