Sciweavers

3244 search results - page 400 / 649
» On convex complexity measures
Sort
View
STACS
1999
Springer
15 years 11 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
FOCS
1993
IEEE
15 years 10 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
DSN
2007
IEEE
15 years 10 months ago
Portable and Efficient Continuous Data Protection for Network File Servers
Continuous data protection, which logs every update to a file system, is an enabling technology to protect file systems against malicious attacks and/or user mistakes, because it ...
Ningning Zhu, Tzi-cker Chiueh
EUROMICRO
2009
IEEE
15 years 10 months ago
Service Redundancy Strategies in Service-Oriented Architectures
Redundancy can improve the availability of components in service-oriented systems. However, predicting and quantifying the effects of different redundancy strategies can be a comp...
Nicholas R. May, Heinz W. Schmidt, Ian E. Thomas
CTRSA
2006
Springer
104views Cryptology» more  CTRSA 2006»
15 years 10 months ago
A New Criterion for Nonlinearity of Block Ciphers
For years, the cryptographic community has searched for good nonlinear functions. Bent functions, almost perfect nonlinear functions, and similar constructions have been suggested ...
Orr Dunkelman, Nathan Keller