1274 search results - page 113 / 255 » Graph lambda theories |
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
The aim of transfer learning is to accelerate learning in related domains. In reinforcement learning, many different features such as a value function and a policy can be transfer...
JGT
2007
13 years 9 months ago
2007
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
MSCS
2007
13 years 8 months ago
2007
Introduced at the end of the nineties, the Rewriting Calculus (ρ-calculus, for short) is a simple calculus that fully integrates term-rewriting and λ-calculus. The rewrite rules...
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we present a novel entity coreference algorithm for Semantic Web instances. The key issues include how to locate context information and how to utilize the context ...