Sciweavers

784 search results - page 103 / 157
» Relaxing the Value Restriction
Sort
View
SIGMOD
1990
ACM
122views Database» more  SIGMOD 1990»
15 years 3 months ago
Access Support in Object Bases
In this work access support relataons are introduced as a means for optlmizmg query processing m object-oriented database systems The general idea 1s to mamtam redundant separate ...
Alfons Kemper, Guido Moerkotte
ANOR
2008
66views more  ANOR 2008»
14 years 11 months ago
Optimization problems involving collections of dependent objects
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
David L. Roberts, Charles L. Isbell, Michael L. Li...
CSDA
2006
92views more  CSDA 2006»
14 years 11 months ago
Robust measures of tail weight
The kurtosis coefficient is often regarded as a measure of the tail heaviness of a distribution relative to that of the normal distribution. However, it also measures the peakedne...
Guy Brys, Mia Hubert, Anja Struyf
ENTCS
2006
125views more  ENTCS 2006»
14 years 11 months ago
Monads and Adjunctions for Global Exceptions
In this paper, we look at two categorical accounts of computational effects (strong monad as a model of the monadic metalanguage, adjunction as a model of call-bypush-value with s...
Paul Blain Levy
ML
2008
ACM
14 years 11 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill