462 search results - page 35 / 93 » Covering a Tree by a Forest |
111
click to vote
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
ACL
2006
14 years 11 months ago
2006
Given a parallel corpus, semantic projection attempts to transfer semantic role annotations from one language to another, typically by exploiting word alignments. In this paper, w...
100
click to vote
JAIR
2008
14 years 9 months ago
2008
In this paper, we show that a continuous spectrum of randomisation exists, in which most existing tree randomisations are only operating around the two ends of the spectrum. That ...
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
Abstract. This paper considers the dynamic tree (DT) model, first introduced in [1]. A dynamic tree specifies a prior over structures of trees, each of which is a forest of one or ...