2 citations · 7 across the 6 of their papers we have counts for
10 papers
An Efficient Newton Algorithm for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence
Damien Lesens, Jérémy E. Cohen, Bora Uçar
Nonnegative Matrix Factorization (NMF) is a fundamental tool in unsupervised learning, which approximates a nonnegative matrix by the product of two low-rank nonnegative factors. T…
Near-Optimal Minimum Cuts in Hypergraphs at Scale
Adil Chhabra, Christian Schulz, Bora Uçar +1
The hypergraph minimum cut problem aims to partition its vertices into two blocks while minimizing the total weight of the cut hyperedges. This fundamental problem arises in networ…
SUperman: Efficient Permanent Computation on GPUs
Deniz Elbek, Fatih Taşyaran, Bora Uçar +1
The permanent is a function, defined for a square matrix, with applications in various domains including quantum computing, statistical physics, complexity theory, combinatorics, a…
Semi-Streaming Algorithms for Hypergraph Matching
Henrik Reinstädtler, S M Ferdous, Alex Pothen +2
We propose two one-pass streaming algorithms for the -hard hypergraph matching problem. The first algorithm stores a small subset of potential matching edges in a sta…
Engineering Edge Orientation Algorithms
H. Reinstädtler, C. Schulz, B. Uçar
Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out deg…
Fully-dynamic Weighted Matching Approximation in Practice
Eugenio Angriman, Henning Meyerhenke, Christian Schulz +1
Finding large or heavy matchings in graphs is a ubiquitous combinatorial optimization problem. In this paper, we engineer the first non-trivial implementations for approximating th…