16188 search results - page 2601 / 3238 » The Optimal PAC Algorithm |
197
click to vote
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
193
click to vote
ICML
2005
IEEE
16 years 8 months ago
2005
IEEE
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...
195
click to vote
ICML
2003
IEEE
16 years 8 months ago
2003
IEEE
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...
197
click to vote
ICML
1999
IEEE
16 years 8 months ago
1999
IEEE
Imitation is actively being studied as an effective means of learning in multi-agent environments. It allows an agent to learn how to act well (perhaps optimally) by passively obs...
191
click to vote
ISBI
2004
IEEE
16 years 8 months ago
2004
IEEE
Three-dimensional rotational angiography (3D-RA) is a relatively new and promising technique for imaging blood vessels. In this paper, we propose a novel 3D-RA vascular segmentati...