Sciweavers

1248 search results - page 62 / 250
» The I Test
Sort
View
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 10 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
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) ...
Daniel Lewin, Salil P. Vadhan
SAC
2006
ACM
16 years 3 days ago
Imprecise RDQL: towards generic retrieval in ontologies using similarity joins
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...
Abraham Bernstein, Christoph Kiefer
CSDA
2008
102views more  CSDA 2008»
15 years 6 months ago
Step-up and step-down procedures controlling the number and proportion of false positives
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 ...
Paul N. Somerville, Claudia Hemmelmann
KBSE
2007
IEEE
16 years 13 days ago
Extraction of bug localization benchmarks from history
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...
Valentin Dallmeier, Thomas Zimmermann
SAC
2005
ACM
15 years 11 months ago
The container loading problem
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...
Andrew Lim, Xingwen Zhang