1688 search results - page 72 / 338 » The Complexity of Rationalizing Matchings |
IBPRIA
2005
Springer
14 years 3 months ago
2005
Springer
In the last decade, consumer graphics cards have increased their power because of the computer games industry. These cards are now programmable and capable of processing huge amoun...
ECCV
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. This paper presents a novel and efficient method for locating deformable shapes in cluttered scenes. The shapes to be detected may undergo arbitrary translational and rot...
DATE
2003
IEEE
14 years 3 months ago
2003
IEEE
While fast timing analysis methods, such as asymptotic waveform evaluation (AWE), have been well established for linear circuits, the timing analysis for non-linear circuits, whic...
ICAPR
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. In this contribution, a novel and robust, geometry-based grouping strategy is proposed. Repeated, planar patterns in special relative positions are detected. The grouping...
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...