2519 search results - page 471 / 504 » Reasoning with Textual Cases |
COLT
1999
Springer
15 years 4 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
103
click to vote
CQRE
1999
Springer
15 years 4 months ago
1999
Springer
Currently, the Internet and the World Wide Web on-line business is booming, with traffic, advertising and content growing at sustained exponential rates. However, the full potentia...
STACS
1999
Springer
15 years 4 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
135
click to vote
SIGMETRICS
1998
ACM
15 years 4 months ago
1998
ACM
Modern disk drives read-ahead data and reorder incoming requests in a workload-dependent fashion. This improves their performance, but makes simple analytical models of them inade...
SIGOPSE
1998
ACM
15 years 4 months ago
1998
ACM
The majority of work on protection in single-language mobile code environments focuses on information security issues and depends on the language environment for solutions to the ...