11121 search results - page 2174 / 2225 » Computing with Continuous Change |
PODS
1999
ACM
15 years 5 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
113
click to vote
COLT
1999
Springer
15 years 5 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...
112
click to vote
VLDB
1999
ACM
15 years 5 months ago
1999
ACM
We describe the architecture of a hypertext resource discovery system using a relational database. Such a system can answer questions that combine page contents, metadata, and hyp...
101
click to vote
SIGOPSE
1998
ACM
15 years 5 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 ...
115
click to vote
PLILP
1997
Springer
15 years 5 months ago
1997
Springer
Abstract. Teaching introductory computing courses with Scheme elevates the intellectual level of the course and thus makes the subject more appealing to students with scienti c int...