Sciweavers

2661 search results - page 179 / 533
» Quantum Complexity Classes
Sort
View
COLT
2007
Springer
16 years 21 days ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
VALUETOOLS
2006
ACM
111views Hardware» more  VALUETOOLS 2006»
16 years 14 days ago
Stability of multi-class queueing systems with state-dependent service rates
We examine the stability of multi-class queueing systems with the special feature that the service rates of the various classes depend on the number of users present of each of th...
Matthieu Jonckheere, Sem C. Borst
SSIAI
2000
IEEE
15 years 11 months ago
Pairwise Markov Random Fields and its Application in Textured Images Segmentation
The use of random fields, which allows one to take into account the spatial interaction among random variables in complex systems, is a frequent tool in numerous problems of stati...
Wojciech Pieczynski, Abdel-Nasser Tebbache
TISSEC
2008
106views more  TISSEC 2008»
15 years 6 months ago
On predictive models and user-drawn graphical passwords
In commonplace text-based password schemes, users typically choose passwords that are easy to recall, exhibit patterns, and are thus vulnerable to brute-force dictionary attacks. ...
Paul C. van Oorschot, Julie Thorpe
CC
2010
Springer
120views System Software» more  CC 2010»
15 years 3 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov