194 search results - page 13 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
108
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
105
click to vote
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
PSD
2004
Springer
15 years 5 months ago
2004
Springer
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
120
Voted
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
76
Voted
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper addresses the problem of simultaneous transmission of multiple multimedia objects (such as images or video sequences) over a bandwidth-limited channel. The trivial stra...