1998 search results - page 389 / 400 » Complexity of the Cover Polynomial |
154
Voted
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We define a new interactive differentially private mechanism — the median mechanism — for answering arbitrary predicate queries that arrive online. Given fixed accuracy and...
154
Voted
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
230
click to vote
CCA
2009
Springer
15 years 10 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
178
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
161
click to vote
ISSTA
2000
ACM
15 years 10 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...