98 search results - page 7 / 20 » Learning Relational Features with Backward Random Walks |
125
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
NIPS
2003
15 years 2 months ago
2003
We study an approach to policy selection for large relational Markov Decision Processes (MDPs). We consider a variant of approximate policy iteration (API) that replaces the usual...
115
click to vote
ECCC
2006
15 years 1 months ago
2006
Detecting the relevant attributes of an unknown target concept is an important and well studied problem in algorithmic learning. Simple greedy strategies have been proposed that s...
128
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
We address the problem of segmenting 3D scan data into objects or object classes. Our segmentation framework is based on a subclass of Markov Random Fields (MRFs) which support ef...
126
click to vote
IJCNN
2008
IEEE
15 years 7 months ago
2008
IEEE
— When an agent observes its environment, there are two important characteristics of the perceived information. One is the relevance of information and the other is redundancy. T...