Sciweavers

1350 search results - page 148 / 270
» Generalized Committed Choice
Sort
View
COLT
1999
Springer
15 years 8 months ago
Regret Bounds for Prediction Problems
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...
Geoffrey J. Gordon
APGV
2007
ACM
130views Visualization» more  APGV 2007»
15 years 8 months ago
A perceptual approach to trimming unstructured lumigraphs
We present a novel perceptual method to reduce the visual redundancy of unstructured lumigraphs, an image based representation designed for interactive rendering. We combine featu...
Yann Morvan, Carol O'Sullivan
HASKELL
2007
ACM
15 years 8 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
ARITH
2001
IEEE
15 years 8 months ago
Computer Arithmetic-A Processor Architect's Perspective
The Instruction Set Architecture (ISA) of a programmable processor is the native languageof the machine. It defines the set of operations and resourcesthat are optimized for that ...
Ruby B. Lee
CF
2005
ACM
15 years 6 months ago
A case for a working-set-based memory hierarchy
Modern microprocessor designs continue to obtain impressive performance gains through increasing clock rates and advances in the parallelism obtained via micro-architecture design...
Steve Carr, Soner Önder