Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...
We present a fast and efficient homing algorithm based on Fourier transformed panoramic images. By continuously comparing Fourier coefficients calculated from the current view wit...
Recently, we proposed a new isosurface extraction algorithm that extracts portions of the isosurface in a viewdependent manner by ray casting and propagation. The algorithm casts ...
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
The goal of the paper is to create a model for investigating the character of relationships between the freedom and restrictions in the terrorism context, in order to find out how ...