In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
Abstract. We evaluate constructions for building pseudo-random functions (PRFs) from pseudo-random permutations (PRPs). We present two constructions: a slower construction which pr...
Chris Hall, David Wagner, John Kelsey, Bruce Schne...
In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the "color-to-spin" property, that i...
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
Hospitals today are investing time and money to expand and improve their Emergency Departments (ED). Using simulation to test their many improvement ideas can necessitate running ...