This paper analyzes the asymptotic behavior of packet-train probing over a multi-hop network path carrying arbitrarily routed bursty cross-traffic flows. We examine the statistical...
Xiliang Liu, Kaliappa Nadar Ravindran, Dmitri Logu...
This paper describes a technique to represent relevant information of tree-like structures in a compact way. The technique is general. In the application described here, the image...
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
The calculation of salient structures is one of the early and basic ideas of perceptual organization in Computer Vision. Saliency algorithms typically mark edge-points with some s...
We propose a general paradigm for computing optimal coordinate frame fields that may be exploited to visualize curves and surfaces. Parallel-transport framings, which work well fo...