4190 search results - page 174 / 838 » Type Class Directives |
119
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
136
click to vote
CATS
2006
15 years 5 months ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
141
Voted
DBPL
1993
Springer
15 years 8 months ago
1993
Springer
A class of database programs exist which are required to operate over an infinite number of types; included in this class are object browsers and query tools. The types over which...
104
click to vote
SIGDIAL
2010
15 years 1 months ago
2010
Incremental natural language understanding is the task of assigning semantic representations to successively larger prefixes of utterances. We compare two types of statistical mod...
141
click to vote
VISUALIZATION
1992
IEEE
15 years 8 months ago
1992
IEEE
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...