3663 search results - page 718 / 733 » Problems in the ontology of computer programs |
CADE
2001
Springer
15 years 10 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
104
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
87
Voted
ALT
2004
Springer
15 years 6 months ago
2004
Springer
Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without inc...