256 search results - page 8 / 52 » On a Generalized Notion of Mistake Bounds |
SIAMCOMP
2000
13 years 7 months ago
2000
We propose a provably efficient application-controlled global strategy for organizing a cache of size k shared among P application processes. Each application has access to informa...
JSYML
2006
13 years 7 months ago
2006
We define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The ...
SIAMDM
2002
13 years 7 months ago
2002
The multicovering radii of a code are recently introduced natural generalizations of the covering radius measuring the smallest radius of balls around codewords that cover all m-t...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We consider online learning where the target concept can change over time. Previous work on expert prediction algorithms has bounded the worst-case performance on any subsequence ...
JSYML
2006
13 years 7 months ago
2006
We introduce and study the notions of a PAC substructure of a stable structure, and a bounded substructure of an arbitrary substructure, generalizing [8]. We give precise definiti...