940 search results - page 75 / 188 » Learning Word Representations from Relational Graphs |
139
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Reinforcement learning deals with learning optimal or near optimal policies while interacting with the environment. Application domains with many continuous variables are difficul...
159
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another ...
140
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Exemplar-based techniques, such as k-nearest neighbors (kNNs) and Sparse Representations (SRs), can be used to model a test sample from a few training points in a dictionary set. ...
161
click to vote
WWW
2003
ACM
16 years 4 months ago
2003
ACM
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...