Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer prov...
Abstract. The classical set theory provides a method for comparing objects using cardinality and intersection, in combination with well-known resemblance coefficients such as Dice,...
Sergio Jimenez, Fabio Gonzalez, Alexander F. Gelbu...
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
We contrast three decision rules that extend Expected Utility to contexts where a convex set of probabilities is used to depict uncertainty: Γ-Maximin, Maximality, and E-admissib...
Mark J. Schervish, Teddy Seidenfeld, Joseph B. Kad...
Abstract-- Methods that faithfully and robustly capture the geometry of complex material interfaces in labeled volume data are important for generating realistic and accurate visua...
Miriah Meyer, Ross Whitaker, Robert M. Kirby, C...