In this paper we extend the knowledge on the problem of empirically searching for sorting networks of minimal depth. We present new search space pruning techniques for the last four levels of a candidate sorting network by considering only the output set representation of a network. We present an algorithm for checking whether an n-input sorting network of depth d exists by considering the mini...

A new computational model for selective visual attention is proposed in this paper. This model simulates the depth-first and resolution-varying visual searching mechanism of human visual system. Firstly, visual saliency of each part is computed at the coarsest resolution. According to the visual saliency, the most salient region is selected. Then the inner details of the selected region are ana...

Depth first search (DFS) tree is a fundamental data structure for solving various problems in graphs. It is well known that it takes O(m+ n) time to build a DFS tree for a given undirected graph G = (V,E) on n vertices and m edges. We address the problem of maintaining a DFS tree when the graph is undergoing updates (insertion and deletion of vertices or edges). We present the following results...

− According to the realist interpretation, measurement is the estimation of numerical relations (or ratios) between magnitudes of a quantitative attribute and a unit. The history of scientific measurement, from antiquity to the present may be interpreted as revealing a progressive deepening in the understanding of this position. First, the concept of ratio was broadened to include ratios betwee...

Computerized chess composers of mate problems are rare. Moreover, so far they do not produce either impressive or creative new mate problems. In this paper, we describe a model called CHESS COMPOSER. This model uses a 64-bit representation, an ordered version of Iterative-Deepening DepthFirst Search, and a quality function built with the help of two international masters in chess-problem compos...

TCPNIA (Timed Colored Petri Nets with Inhibitor Arcs, TCPNIA) is a model for specifying real-time embedded systems. It integrates features of colored Petri nets, timed Petri nets and inhibitor arcs. The methods for modeling modules of systems using TCPNIA are proposed. A depth-first scheduling algorithm for TCPNIA is proposed. The system level resource’s influence to schedulable path is conside...

Today we will discuss two more applications of the low degree algorithm. First we will look at constant depth circuits. We will cite a theorem regarding the Fourier concentration of functions computable by constant depth circuits and we will use this theorem as well as the low degree algorithm to show how we can learn constant depth circuits. Second we will begin to develop the theory need to l...

This paper presents a global reduction algorithm for wormhole-routed 2D meshes. Well-known reduction algorithms that are optimized for short vectors have complexity O(M log N), where N = nn is the number of nodes, and M the vector length. Algorithms suitable for long vectors have complexity O(p N +M). Previously known asymptotically optimal algorithms with complexity O(log N + M) incur inherent...

In this paper we explore the extension of 2D pointing facilitation techniques to 3D object selection. We discuss what problems must be faced when adapting such techniques to 3D interaction on VR applications, and we propose two strategies to adapt the expanding targets approach to the 3D realm, either by dynamically scaling potential targets or by using depth-sorting to guarantee that potential...

We describe a novel approach to view interpolation from image sequences based on probabilistic depth carving. This builds a multivalued representation of depth for novel views consisting of likelihoods of depth samples corresponding to either opaque or free space points. The likelihoods are obtained from iterative probabilistic combination of local disparity estimates about a subset of referenc...