The following pages link to PROXIMUS (Q17136):
Displaying 12 items.
- Scalable density-based clustering with quality guarantees using random projections (Q1741164) (← links)
- Integer matrix approximation and data mining (Q1747623) (← links)
- Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
- BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent (Q2066656) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- On the rank-one approximation of positive matrices using tropical optimization methods (Q2289366) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets (Q2502286) (← links)
- The bipartite Boolean quadric polytope (Q2673249) (← links)
- A Clustering Approach to Constrained Binary Matrix Factorization (Q4631260) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- The Bipartite QUBO (Q5050150) (← links)
