Sciweavers

64 search results - page 10 / 13
» Recursive Analysis Characterized as a Class of Real Recursiv...
Sort
View
AI
2008
Springer
13 years 7 months ago
On the notion of concept I
It is well known that classical set theory is not expressive enough to adequately model categorization and prototype theory. Recent work on compositionality and concept determinat...
Michael Freund
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
13 years 7 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger
POPL
2009
ACM
14 years 8 months ago
Automatic modular abstractions for linear constraints
c Modular Abstractions for Linear Constraints David Monniaux VERIMAG June 27, 2008 se a method for automatically generating abstract transformers for static by abstract interpreta...
David Monniaux
STACS
2012
Springer
12 years 3 months ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
ACTA
2008
88views more  ACTA 2008»
13 years 6 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish