940 search results - page 87 / 188 » Learning Word Representations from Relational Graphs |
120
Voted
FGCS
2000
15 years 3 months ago
2000
The LOGFLOW parallel Prolog system is similar to the recent parallel database systems concerning its dataflow execution model and its capability of running on othing architectures...
135
click to vote
NAACL
2007
15 years 5 months ago
2007
In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...
134
click to vote
COLT
2006
Springer
15 years 7 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
124
click to vote
ICFEM
2009
Springer
15 years 8 months ago
2009
Springer
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
141
click to vote
IJCNN
2006
IEEE
15 years 10 months ago
2006
IEEE
— The number of XML documents produced and available on the Internet is steadily increasing. It is thus important to devise automatic procedures to extract useful information fro...