3229 search results - page 464 / 646 » The Theory of Timed Automata |
182
click to vote
COLT
1999
Springer
15 years 11 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...
177
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
179
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
184
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
191
click to vote
AFRIGRAPH
2007
ACM
15 years 10 months ago
2007
ACM
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...