Pages that link to "Item:Q3549174"
From MaRDI portal
The following pages link to Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis (Q3549174):
Displaying 10 items.
- An integer approximation method for discrete sinusoidal transforms (Q411197) (← links)
- Semantic indexing in structured peer-to-peer networks (Q436647) (← links)
- Integer matrix approximation and data mining (Q1747623) (← links)
- Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
- A divide-and-conquer algorithm for binary matrix completion (Q2187387) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- The bipartite Boolean quadric polytope (Q2673249) (← links)
- A Clustering Approach to Constrained Binary Matrix Factorization (Q4631260) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)