Sciweavers

911 search results - page 80 / 183
» Kolmogorov Complexity Cores
Sort
View
EUROCRYPT
2010
Springer
15 years 9 months ago
Constructing Verifiable Random Functions with Large Input Spaces
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
Susan Hohenberger, Brent Waters
SWAP
2008
15 years 7 months ago
SAscha: A RIA Approach for Supporting Semantic Web Services in the Italian Interoperability Framework
SPCoop is a nationwide framework for supporting service interoperability in the exercise and application of Italian government policies. The very core of this framework lies in the...
Alessandro Adamou
NSDI
2004
15 years 7 months ago
Path-Based Failure and Evolution Management
We present a new approach to managing failures and evolution in large, complex distributed systems using runtime paths. We use the paths that requests follow as e through the syst...
Mike Y. Chen, Anthony Accardi, Emre Kiciman, David...
FMICS
2010
Springer
15 years 6 months ago
Correctness of Sensor Network Applications by Software Bounded Model Checking
We investigate the application of the software bounded model checking tool CBMC to the domain of wireless sensor networks (WSNs). We automatically generate a software behavior mode...
Frank Werner, David Faragó
HEURISTICS
2000
127views more  HEURISTICS 2000»
15 years 6 months ago
Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
Joel W. Gannett