The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
As host mobility and radio interference in wireless networks cause packet losses and delays, it is difficult to develop useful mobile real-time media applications. This paper descr...
This note conjectures that if two surface patches intersect with G1 continuity along an entire curve, the probability is one that the curve is rational. This idea has significance...
In this paper, we address the issue of traffic grooming in arbitrary WDM mesh networks. We present a novel groomer architecture wherein a combination of grooming at two different ...
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...