9 citations · 17 across the 3 of their papers we have counts for
3 papers
cs.CG2011★ 1 cited
A Doubly Exponentially Crumbled Cake
Tobias Christ, Andrea Francke, Heidi Gebauer +2
We consider the following cake cutting game: Alice chooses a set P of n points in the square (cake) [0,1]^2, where (0,0) is in P; Bob cuts out n axis-parallel rectangles with disjo…
cs.DS2011★ 7 cited
Efficient Algorithms for Dualizing Large-Scale Hypergraphs
Keisuke Murakami, Takeaki Uno
A hypergraph is a set family defined on vertex set . The dual of is the set of minimal subsets of such that for any $F\in {…
cs.DS2009★ 9 cited
Efficient Construction of Neighborhood Graphs by the Multiple Sorting Method
Takeaki Uno, Masashi Sugiyama, Koji Tsuda
Neighborhood graphs are gaining popularity as a concise data representation in machine learning. However, naive graph construction by pairwise distance calculation takes r…