1601 search results - page 68 / 321 » Closed Sets for Labeled Data |
105
click to vote
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
100
click to vote
AAAI
2012
13 years 2 months ago
2012
Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a n...
105
click to vote
ALT
2003
Springer
15 years 3 months ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
AND
2010
14 years 10 months ago
2010
In this paper we will present a set of experiments using large digitalized collections of books to show that logical structures can be extracted with good quality when working at ...
DAWAK
2010
Springer
15 years 2 days ago
2010
Springer
Abstract. This paper addresses a task of variable selection which consists in choosing a subset of variables that is sufficient to predict the target label well. Here instead of tr...