Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
In 2006, Blake, Murty and Xu proposed three refinements to Miller’s algorithm for computing Weil/Tate Pairings. In this paper we extend their work and propose a generalized algo...
In this paper, we propose a new global router, BoxRouter, powered by the concept of box expansion and progressive integer linear programming (ILP). BoxRouter first uses a simple P...
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
Robust integration of range images is an important task for building high-quality 3D models. Since range images, and in particular range maps from stereo vision, may have a substa...