Bin Fu

activity

20102022

most citedMultivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2018

Speeding Up Constrained $k$ -Means Through 2-Means

Qilong Feng, Bin Fu

For the constrained 2-means problem, we present a $O (d n + d (\frac{1}{ε})^{O (\frac{1}{ε})} lo g n)$ time algorithm. It generates a collection $U$ of approximate center pairs $(…

cs.CG2018

Polyhedra Circuits and Their Applications

Bin Fu, Pengfei Gu, Yuming Zhao

We introduce polyhedra circuits. Each polyhedra circuit characterizes a geometric region in $R^{d}$ . They can be applied to represent a rich class of geometric objects, whic…

Speeding Up Constrained k-Means Through 2-Means

Polyhedra Circuits and Their Applications

Speeding Up Constrained $k$ -Means Through 2-Means