Sciweavers

363 search results - page 17 / 73
» Partial Multicuts in Trees
Sort
View
ECML
2007
Springer
14 years 4 months ago
Transfer Learning in Reinforcement Learning Problems Through Partial Policy Recycling
In this paper we investigate the relation between transfer learning in reinforcement learning with function approximation and supervised learning with concept drift. We present a n...
Jan Ramon, Kurt Driessens, Tom Croonenborghs
WABI
2007
Springer
121views Bioinformatics» more  WABI 2007»
14 years 3 months ago
Seeded Tree Alignment and Planar Tanglegram Layout
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computat...
Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabr...
DM
2008
91views more  DM 2008»
13 years 10 months ago
Lower bounds for the game colouring number of partial k-trees and planar graphs
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
Jiaojiao Wu, Xuding Zhu
WG
2004
Springer
14 years 3 months ago
Collective Tree Spanners and Routing in AT-free Related Graphs
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
CVPR
2006
IEEE
14 years 12 months ago
The Layout Consistent Random Field for Recognizing and Segmenting Partially Occluded Objects
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
John M. Winn, Jamie Shotton