6598 search results - page 292 / 1320 » Graph Theory with Applications |
185
click to vote
SCIA
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of a multiplicity alpha overlay shadow mo...
154
click to vote
ICALP
2010
Springer
15 years 11 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...
170
click to vote
ATAL
2008
Springer
15 years 8 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...
172
Voted
JGT
2007
15 years 6 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...
197
click to vote
CIKM
2010
Springer
15 years 5 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 ...