1425 search results - page 258 / 285 » Beyond Dependency Graphs |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
ECIR
2011
Springer
12 years 11 months ago
2011
Springer
Expert finding addresses the problem of retrieving a ranked list of people who are knowledgeable on a given topic. Several models have been proposed to solve this task, but so far...
SAC
2011
ACM
12 years 10 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
CIE
2011
Springer
12 years 8 months ago
2011
Springer
Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnabilit...
ICDAR
2011
IEEE
12 years 7 months ago
2011
IEEE
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...