Sciweavers

1445 search results - page 56 / 289
» Uniformly Hard Languages
Sort
View
CIE
2006
Springer
14 years 1 months ago
Inverting Monotone Continuous Functions in Constructive Analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
GIL
2009
13 years 7 months ago
The Need for Content-lists, Dictionaries and Ontologies in Expressing and Evaluating Compliance to Crop-production Regulations,
: Regulations and standards are playing an increasingly important role in crop production. Common to the vast majority of these is that they are written in a natural language which...
Edward Nash
ICDT
1995
ACM
96views Database» more  ICDT 1995»
14 years 1 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
SAIG
2001
Springer
14 years 2 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 10 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner