148 search results - page 14 / 30 » Linear reductions of maximum matching |
BMVC
2000
14 years 11 months ago
2000
We consider the problem of representing sets of 3D points in the context of 3D reconstruction from point matches. We present a new representation for sets of 3D points, which is g...
69
Voted
SIBGRAPI
2006
IEEE
15 years 3 months ago
2006
IEEE
The single triangle-strip loop generation algorithm on a triangulated two-manifold presented by Gopi and Eppstein [4] is based on the guaranteed existence of a perfect matching in...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
TASLP
2010
14 years 4 months ago
2010
In the presence of environmental noise, speakers tend to adjust their speech production in an effort to preserve intelligible communication. The noise-induced speech adjustments, c...