Search Results for author:
Found 3 papers, 0 papers with code
Some i-Mark games
We solve this problem by calculating the Sprague-Grundy function of $i$-Mark$([1, t-1],\{d\})$ for $d \equiv 1 \pmod t$, for all $t, d \geq 2$.
Combinatorics Discrete Mathematics 91A46
Nested Barycentric Coordinate System as an Explicit Feature Map
We propose a new embedding method which is particularly well-suited for settings where the sample size greatly exceeds the ambient dimension.
Learning convex polyhedra with margin
We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin.
