5363 search results - page 859 / 1073 » Building the Cerebellum in a Computer |
172
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
166
click to vote
LREC
2010
15 years 8 months ago
2010
This paper presents the PolNet-Polish WordNet project which aims at building a linguistically oriented ontology for Polish compatible with other WordNet projects such as Princeton...
155
click to vote
LREC
2010
15 years 8 months ago
2010
Dialogue Acts have been well studied in linguistics and attracted computational linguistics research for a long time: they constitute the basis of everyday conversations and can b...
168
click to vote
LREC
2010
15 years 8 months ago
2010
Today's natural language processing systems are growing more complex with the need to incorporate a wider range of language resources and more sophisticated statistical metho...
136
click to vote
LREC
2010
15 years 8 months ago
2010
This paper presents an algorithm for aligning FrameNet lexical units to WordNet synsets. Both, FrameNet and WordNet, are well-known as well as widely-used resources by the entire ...