An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchr...
More and more fonts have sprung up in recent years in digital publishing industry and reading devices. In this paper, we focus on methods of evaluating digital Chinese fonts and t...
People often use computers other than their own to access web content, but blind users are restricted to using computers equipped with expensive, special-purpose screen reading pr...
Jeffrey P. Bigham, Craig Prince, Richard E. Ladner
Comprehending an unfamiliar code fragment requires an awareness of explicit usage directives that may be present in the documentation of some invoked functions. Since it is not pr...