Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
This paper attempts to analyze the issue of planning and scheduling integration from the point of view of information sharing. This concept is the basic bridging factor between the...
Many people do not read easily for all sorts of reasons: social and cultural, because of impairments, or because of their context. Even in the area of impairments, design for peop...
Caroline Jarrett, Katie Grant, B. L. William Wong,...
In this paper we bring to light a novel intersection between corpus linguistics and behavioral data that can be employed as an evaluation metric for resources for low-density lang...
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....