436 search results - page 24 / 88 » A Note on Negligible Functions |
ICIAP
2007
ACM
14 years 8 months ago
2007
ACM
Real-time histogram specification methods aims to find a continuous function that transforms a source image to match a target distribution with the highest possible degree of accu...
Book
"These notes were prepared for use in the graduate course Computer Science 15–
814: Type Systems for Programming Languages at Carnegie Mellon University.
Their purpose is ...
LICS
1996
IEEE
14 years 19 days ago
1996
IEEE
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application,we show that the pca of str...
ARSCOM
2008
13 years 8 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
ENTCS
2008
13 years 8 months ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...