1136 search results - page 103 / 228 » Finding Small Holes |
JCO
2008
13 years 9 months ago
2008
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 ...
RAS
2006
13 years 8 months ago
2006
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...
CG
2002
Springer
13 years 8 months ago
2002
Springer
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 ...
ECCC
2000
13 years 8 months ago
2000
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...
INFORMATICALT
2002
13 years 8 months ago
2002
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 ...