1688 search results - page 26 / 338 » The Complexity of Rationalizing Matchings |
ANTS
2004
Springer
14 years 1 months ago
2004
Springer
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
CPHYSICS
2011
13 years 2 months ago
2011
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Calibration techniques for projector-based displays typically require that the display configuration remain fixed, since they are unable to adapt to changes such as the movement o...
ICMCS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present a semi-automatic image-based modeling system to make 3-D models from photographs. The human operator intervenes only for simple and straightforward tasks. The design of...
IPL
2006
13 years 7 months ago
2006
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing