2297 search results - page 24 / 460 » An Algorithm for Computing the Integral Closure |
100
click to vote
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
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...
AMC
2007
14 years 12 months ago
2007
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...
112
click to vote
DAC
2006
ACM
16 years 23 days ago
2006
ACM
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...
102
click to vote
SIGCOMM
1996
ACM
15 years 3 months ago
1996
ACM
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...
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
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...