Pages that link to "Item:Q4210149"

The following pages link to A Spectral Algorithm for Seriation and the Consecutive Ones Problem (Q4210149):

Displaying 41 items.

• Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices (Q263094) (← links)
• Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
• Continuation methods for approximate large scale object sequencing (Q669313) (← links)
• \texttt{PQser:} a Matlab package for spectral seriation (Q670489) (← links)
• A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
• Discovering bands from graphs (Q736508) (← links)
• Uniform embeddings for Robinson similarity matrices (Q832894) (← links)
• Graph spectral image smoothing using the heat kernel (Q941573) (← links)
• Approximation and fixed-parameter algorithms for consecutive ones submatrix problems (Q972381) (← links)
• Two improved algorithms for envelope and wavefront reduction (Q1371664) (← links)
• Optimal rates of statistical seriation (Q1715546) (← links)
• An experimental comparison of seriation methods for one-mode two-way data (Q1752777) (← links)
• New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
• The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (Q1785334) (← links)
• A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
• Recovering the structure of random linear graphs (Q1790469) (← links)
• Reconstruction of line-embeddings of graphons (Q2136610) (← links)
• Estimation of Monge matrices (Q2203631) (← links)
• Regime switching model estimation: spectral clustering hidden Markov model (Q2241182) (← links)
• Graph characteristics from the heat kernel trace (Q2270728) (← links)
• Obtaining matrices with the consecutive ones property by row deletions (Q2343088) (← links)
• Polynomial-time local-improvement algorithm for consecutive block minimization (Q2345864) (← links)
• Minimising the number of gap-zeros in binary matrices (Q2355802) (← links)
• Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks (Q2407156) (← links)
• Heat kernel embeddings, differential geometry and graph structure (Q2422513) (← links)
• Heuristic methods to consecutive block minimization (Q2664289) (← links)
• The seriation problem in the presence of a double Fiedler value (Q2679667) (← links)
• The perturbed laplacian matrix of a graph (Q2762312) (← links)
• Graphs, Vectors, and Matrices (Q3178747) (← links)
• Convex Relaxations for Permutation Problems (Q3456867) (← links)
• An Optimal Algorithm for Strict Circular Seriation (Q5018899) (← links)
• Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
• A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM (Q5249001) (← links)
• Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
• An Optimization Parameter for Seriation of Noisy Data (Q5376542) (← links)
• Experiments on the minimum linear arrangement problem (Q5463444) (← links)
• A Simple and Optimal Algorithm for Strict Circular Seriation (Q5888295) (← links)
• Three conjectures of Ostrander on digraph Laplacian eigenvectors (Q5888904) (← links)
• On Physical Mapping and the consecutive ones property for sparse matrices (Q5961616) (← links)
• Localization in 1D non-parametric latent space models from pairwise affinities (Q6170608) (← links)
• Modules in Robinson Spaces (Q6187080) (← links)