1658 search results - page 50 / 332 » Learning Unknown Graphs |
119
click to vote
CIE
2007
Springer
15 years 9 months ago
2007
Springer
In the standard model of inductive inference, a learner gets as input the graph of a function, and has to discover (in the limit) a program for the function. In this paper, we cons...
131
click to vote
ALT
2007
Springer
15 years 12 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
108
Voted
FOCS
1994
IEEE
15 years 7 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
138
click to vote
JMLR
2010
14 years 9 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
COLT
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...