16430 search results - page 798 / 3286 » On Computable Tree Functions |
207
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
188
click to vote
ENTCS
2002
15 years 7 months ago
2002
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jorda...
221
click to vote
CDVE
2007
Springer
16 years 1 months ago
2007
Springer
In order to build complex, large-scale, dependable systems it is necessary to use a development environment with an integrated set of capabilities that supports editing and formal...
356
click to vote
ML
2011
ACM
15 years 2 months ago
2011
ACM
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
254
click to vote
DAGSTUHL
2010
15 years 9 months ago
2010
We apply Knoll et al.'s algorithm [9] to interactively ray-cast constructive solid geometry (CSG) objects of arbitrary primitives represented as implicit functions. Whereas m...