Biblioteca Digital

13 resultados para graph matching algorithms

em CUNY Academic Works

TR-2002015: Residual Correction Algorithms for General and Structured Matrices

Relevância:

20.00% 20.00%

Publicador:

TR-2002019: Improved Algorithms for Computing Determinants and Resultants

Relevância:

20.00% 20.00%

Publicador:

TR-2003004: Superfast Algorithms for Singular Toeplitz/Hankel-like Matrices

Relevância:

20.00% 20.00%

Publicador:

TR-2003013: QR-Like Algorithms for Generalized Semiseparable Matrices

Relevância:

20.00% 20.00%

Publicador:

TR-2004013: Toeplitz and Hankel Meet Hensel and Newton: Nearly Optimal Algorithms and Their Practical Acceleration with Saturated Initialization

Relevância:

20.00% 20.00%

Publicador:

TR-2004015: Superfast Algorithms for Singular Toeplitz-like Matrices

Relevância:

20.00% 20.00%

Publicador:

TR-2008003: Unified Nearly Optimal Algorithms for Structured Integer Matrices and Polynomials

Relevância:

20.00% 20.00%

Publicador:

TR-2010006: Graph-Based Clustering and Its Application in Coreference Resolution

Relevância:

20.00% 20.00%

Publicador:

TR-2012001: Algebraic Algorithms

Relevância:

20.00% 20.00%

Publicador:

TR-2013009: Algebraic Algorithms

Relevância:

20.00% 20.00%

Publicador:

TR-2013011: Fast Approximation Algorithms for Cauchy Matrices, Polynomials and Rational Functions

Relevância:

20.00% 20.00%

Publicador:

TR-2014005: Fast Approximation Algorithms for Computations with Cauchy Matrices and Extensions

Relevância:

20.00% 20.00%

Publicador:

TR-2014006: New Algorithms in the Frobenius Matrix Algebra for Polynomial Root-Finding

Relevância:

20.00% 20.00%

Publicador: