Search Results for author:
Found 6 papers, 0 papers with code
Boolean and $\mathbb{F}_p$-Matrix Factorization: From Theory to Practice
Boolean Matrix Factorization (BMF) aims to find an approximation of a given binary matrix as the Boolean product of two low-rank binary matrices.
Diverse Collections in Matroids and Graphs
The input to the Weighted Diverse Bases problem consists of a matroid $M$, a weight function $\omega:E(M)\to\mathbb{N}$, and integers $k\geq 1, d\geq 0$.
Data Structures and Algorithms
EPTAS for $k$-means Clustering of Affine Subspaces
We consider a generalization of the fundamental $k$-means clustering for data with incomplete or corrupted entries.
Refined Complexity of PCA with Outliers
Principal component analysis (PCA) is one of the most fundamental procedures in exploratory data analysis and is the basic step in applications ranging from quantitative finance and bioinformatics to image analysis and neuroscience.
Target Set Selection parameterized by vertex cover and more
We have the following results on the TSS problem: -> It was shown by Nichterlein et al. [Social Network Analysis and Mining, 2013] that it is possible to compute an optimal-sized target set in $O(2^{(2^{t}+1)t}\cdot m)$ time, where $t$ denotes the cardinality of a minimum degree-$0$ modulator of $G$.
Computational Complexity Data Structures and Algorithms Social and Information Networks 68W25, 68Q17, 68R10,
Approximation Schemes for Low-Rank Binary Matrix Approximation Problems
The new constrained clustering problem encompasses a number of problems and by solving it, we obtain the first linear time-approximation schemes for a number of well-studied fundamental problems concerning clustering of binary vectors and low-rank approximation of binary matrices.
