2343 search results - page 108 / 469 » Structure and Interpretation of Computer Programs |
103
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
We study the boundedness problem for monadic least fixed points as a decision problem. While this problem is known to be undecidable in general and even for syntactically very res...
140
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
141
click to vote
GRC
2007
IEEE
15 years 8 months ago
2007
IEEE
Granular computing is not only a computing model for computer-centered problem solving, but also a thinking model for human-centered problem solving. Some authors have presented t...
148
click to vote
WABI
2005
Springer
15 years 10 months ago
2005
Springer
In contrast to proteins, many classes of functionally related RNA molecules show a rather weak sequence conservation but instead a fairly well conserved secondary structure. Hence ...
256
click to vote
Source Code
A Vtk program that visualizes n objects (i.e., anatomical structures) in a stack of PGM files. Each structure is labeled by an integer number. For example, the labels of 3 structur...