We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Traditional semantic web query languages support a logicbased access to the semantic web. They offer a retrieval (or reasoning) of data based on facts. On the traditional web and...
In multiple hypotheses testing, it is important to control the probability of rejecting "true" null hypotheses. A standard procedure has been to control the family-wise ...
Researchers have proposed a number of tools for automatic bug localization. Given a program and a description of the failure, such tools pinpoint a set of statements that are most...
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...