7988 search results - page 1229 / 1598 » A Useful Undecidable Theory |
161
click to vote
OOPSLA
2005
Springer
16 years 10 days ago
2005
Springer
Representing programs as text strings makes programming harder then it has to be. The source text of a program is far removed from its behavior. Bridging this conceptual gulf is w...
203
click to vote
SCALESPACE
2005
Springer
16 years 10 days ago
2005
Springer
We investigate the use of fractional powers of the Laplacian for signal and image simplification. We focus both on their corresponding variational techniques and parabolic pseudod...
166
click to vote
SEMWEB
2005
Springer
16 years 9 days ago
2005
Springer
This paper extends the model theory of RDF with rules, placing an emphasis on integration with OWL and decidability of entailstart from an abstract syntax that views a rule as a pa...
178
click to vote
VISUAL
2005
Springer
16 years 9 days ago
2005
Springer
This contribution details how conceptual characterizations of route knowledge can provide the basis for graphical route information in a cognitively adequate way. The approach is b...
163
click to vote
ACMDIS
2004
ACM
16 years 8 days ago
2004
ACM
Privacy is a difficult design issue that is becoming increasingly important as we push into ubiquitous computing environments. While there is a fair amount of theoretical work on ...