Sciweavers

4716 search results - page 605 / 944
» Tangible functional programming
Sort
View
CGO
2006
IEEE
15 years 5 months ago
Exhaustive Optimization Phase Order Space Exploration
The phase-ordering problem is a long standing issue for compiler writers. Most optimizing compilers typically have numerous different code-improving phases, many of which can be a...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson, ...
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
15 years 5 months ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman
COLT
1999
Springer
15 years 3 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
DEXA
1999
Springer
87views Database» more  DEXA 1999»
15 years 3 months ago
SECONDO/QP: Implementation of a Generic Query Processor
: In an extensible database system, evaluation of a query plan is done in cooperation between a collection of operator implementation functions and a component of the DBMS that we ...
Ralf Hartmut Güting, Stefan Dieker, Claudia F...
VISUALIZATION
1997
IEEE
15 years 3 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano