4486 search results - page 816 / 898 » Adaptable Boundary Sets |
123
click to vote
COLT
2001
Springer
15 years 5 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
CRYPTO
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
79
Voted
DSN
2000
IEEE
15 years 5 months ago
2000
IEEE
ÐWe study the quality of service (QoS) of failure detectors. By QoS, we mean a specification that quantifies 1) how fast the failure detector detects actual failures and 2) how we...
95
Voted
ISSTA
2000
ACM
15 years 5 months ago
2000
ACM
A number of different concepts have been proposed that, loosely speaking, revolve around the notion of software testability. Indeed, the concept of testability itself has been int...
112
Voted
CPM
2000
Springer
15 years 5 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...