We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
Bin Gao, Tie-Yan Liu, Zhiming Ma, Taifeng Wang, Ha...
Automatic circuit placement has received renewed interest recently given the rapid increase of circuit complexity, increase of interconnect delay, and potential sub-optimality of ...
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...