Sciweavers

3208 search results - page 262 / 642
» A Lower Bound for Primality
Sort
View
JCS
2000
148views more  JCS 2000»
15 years 6 months ago
Using Sample Size to Limit Exposure to Data Mining
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the "prob abilistic&...
Chris Clifton
COMBINATORICS
1998
66views more  COMBINATORICS 1998»
15 years 6 months ago
Some New Ramsey Colorings
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...
Geoffrey Exoo
CJTCS
1999
133views more  CJTCS 1999»
15 years 6 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
RSA
1998
93views more  RSA 1998»
15 years 6 months ago
Parallel randomized load balancing
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
Micah Adler, Soumen Chakrabarti, Michael Mitzenmac...
SOFTWARE
2002
15 years 6 months ago
A Query-Driven Anytime Algorithm for Argumentative and Abductive Reasoning
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
Rolf Haenni