1658 search results - page 34 / 332 » Learning Unknown Graphs |
108
click to vote
TNN
2008
15 years 5 months ago
2008
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
132
click to vote
JMLR
2010
14 years 12 months ago
2010
We consider reinforcement learning as solving a Markov decision process with unknown transition distribution. Based on interaction with the environment, an estimate of the transit...
242
click to vote
IJCAI
1993
15 years 6 months ago
1993
This paper describes a technique whereby an autonomous agent such as a mobile robot can explore an unknown environment and make a topologicalmapofit. It is assumedthat the environ...
145
click to vote
COMGEO
2007
ACM
15 years 5 months ago
2007
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
142
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper presents a simple randomised algorithm for recovering high-dimensional sparse functions, i.e. functions f : [0, 1]d → R which depend effectively only on k out of d va...