The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...
In this paper, we propose a document clustering method that strives to achieve: (1) a high accuracy of document clustering, and (2) the capability of estimating the number of clus...
This paper investigates the dimensionality characteristics of the outcome space of a combat simulation. The independent state variables of all of the outcome states for a simulati...
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
Mobile imaging and digital storytelling currently support a growing practice of multimedia communication in the West. In this paper we describe a project which explores their bene...
David M. Frohlich, Dorothy Rachovides, Kiriaki Rig...