Sciweavers

1380 search results - page 193 / 276
» A General Polynomial Sieve
Sort
View
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
14 years 3 months ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio
CALCO
2007
Springer
86views Mathematics» more  CALCO 2007»
14 years 3 months ago
Bootstrapping Types and Cotypes in HasCASL
We discuss the treatment of initial datatypes and final process types in the wide-spectrum language HasCASL. In particular, we present specifications that illustrate how datatype...
Lutz Schröder
CCS
2007
ACM
14 years 3 months ago
An algorithm for the appraisal of assurance indicators for complex business processes
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...
Fabio Massacci, Artsiom Yautsiukhin
CIA
2007
Springer
14 years 3 months ago
Quantifying the Expected Utility of Information in Multi-agent Scheduling Tasks
Abstract. In this paper we investigate methods for analyzing the expected value of adding information in distributed task scheduling problems. As scheduling problems are NP-complet...
Avi Rosenfeld, Sarit Kraus, Charlie Ortiz
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
14 years 3 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan