CoolFace
4 shown

datasets

Training and evaluation data, with the modality, task and licence stated up front. Listed live from the Hugging Face Hub.

Clear all
01latticeflow /resultstextn<1K0 likes28 downloads2y agoHugging Face02ACDRepo /partial_orders_on_lattice_paths_11x10 Dataset Card for Partial Orders on Lattice Paths from (0,0)(0,0)(0,0) to (11,10)(11,10)(11,10) Consider northeast lattice paths that travel along the edges of a grid from (0,0)(0, 0)(0,0) to (a,b)(a, b)(a,b), only taking steps north and east and never passing through the diagonal y=baxy = \frac{b}{a}xy=ab​x, where aaa and bbb are relatively prime. [1] defines two order relations on such paths called the matching ordering (≤M)(\leq_M)(≤M​)and the Lagrange ordering (≤L)(\leq_L)(≤L​)… See the full description on the dataset page: https://huggingface.co/datasets/ACDRepo/partial_orders_on_lattice_paths_11x10.10K<n<100K0 likes18 downloads1y agoHugging Face03ACDRepo /partial_orders_on_lattice_paths_12x11 Dataset Card for Partial Orders on Lattice Paths from (0,0)(0,0)(0,0) to (12,11)(12,11)(12,11) Consider northeast lattice paths that travel along the edges of a grid from (0,0)(0, 0)(0,0) to (a,b)(a, b)(a,b), only taking steps north and east and never passing through the diagonal y=baxy = \frac{b}{a}xy=ab​x, where aaa and bbb are relatively prime. [1] defines two order relations on such paths called the matching ordering (≤M)(\leq_M)(≤M​)and the Lagrange ordering (≤L)(\leq_L)(≤L​)… See the full description on the dataset page: https://huggingface.co/datasets/ACDRepo/partial_orders_on_lattice_paths_12x11.100K<n<1M0 likes18 downloads1y agoHugging Face04ACDRepo /partial_orders_on_lattice_paths_10x9 Dataset Card for Partial Orders on Lattice Paths from (0,0)(0,0)(0,0) to (10,9)(10,9)(10,9) Consider northeast lattice paths that travel along the edges of a grid from (0,0)(0, 0)(0,0) to (a,b)(a, b)(a,b), only taking steps north and east and never passing through the diagonal y=baxy = \frac{b}{a}xy=ab​x, where aaa and bbb are relatively prime. [1] defines two order relations on such paths called the matching ordering (≤M)(\leq_M)(≤M​)and the Lagrange ordering (≤L)(\leq_L)(≤L​)… See the full description on the dataset page: https://huggingface.co/datasets/ACDRepo/partial_orders_on_lattice_paths_10x9.10K<n<100K0 likes11 downloads1y agoHugging Face

Listings come live from the Hugging Face Hub API. CoolFace does not host these files.