Let F be a field with positive odd characteristic p. We prove a variety of new sum-product type estimates over F . They are derived from the theorem that the number of incidences between m points and n planes in the projective three-space PG(3, F ), with m ≥ n = O(p), is O(m √ n+ km), where k denotes the maximum number of collinear planes. The main result is a significant improvement of the sta...

Abstract Bipartite incidence graph sampling provides a unified representation of many situations for the purpose estimation, including existing unconventional methods, such as indirect, network or adaptive cluster sampling, which are not originally described problems. We develop large class design-based linear estimators, defined sample edges and subjected to general condition design unbiasedne...

Structural pattern recognition approaches offer the most expressive, convenient, powerful but computational expensive representations of underlying relational information. To benefit from mature, less expensive and efficient state-of-the-art machine learning models of statistical pattern recognition they must be mapped to a low-dimensional vector space. Our method of explicit graph embedding br...

This paper is concerned with the problem of tracking groups of extended features in image sequences. A graph based image structure tracker is presented. The tracking is based on matching fuzzy features and feature relationships. Edges are extracted from subsequent frames. Fuzzy relational graphs are built from each image. The nodes of these graphs represent edge segments while the arcs code the...

Fuzzy metagraph is an emerging technique used in the design of many information processing systems like transaction processing systems, decision support systems, and workflow systems. Very often, even a carefully chosen graph data structure could be improvised to provide more efficiency in terms of time complexity or space complexity or both. In this paper, a well-designed fuzzy metagraph is pr...

We describe the Hoffman-Singleton graph geometrically, showing that it is closely related to the incidence graph of the affine plane over Z5. This allows us to construct all automorphisms of the graph.