940 search results - page 65 / 188 » Learning Word Representations from Relational Graphs |
168
click to vote
NEUROSCIENCE
2001
Springer
15 years 8 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
150
click to vote
WEBI
2005
Springer
15 years 10 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
156
click to vote
CLEIEJ
2010
15 years 1 months ago
2010
Logic programming is one of the most important subjects for students pursuing a degree in Information Technology and Communication (ITC) at higher education institutions. Teaching ...
177
click to vote
GC
2010
Springer
15 years 2 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
124
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...