5144 search results - page 889 / 1029 » Enhancing Search with Structure |
147
click to vote
CSC
2008
15 years 6 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...
143
Voted
LREC
2010
15 years 6 months ago
2010
The paper presents Bulgarian National Corpus project (BulNC) - a large-scale, representative, online available corpus of Bulgarian. The BulNC is also a monolingual general corpus,...
114
click to vote
LREC
2010
15 years 6 months ago
2010
Evaluating complex Natural Language Processing (NLP) systems can prove extremely difficult. In many cases, the best one can do is to evaluate these systems indirectly, by looking ...
135
click to vote
LREC
2008
15 years 6 months ago
2008
Automatic Term recognition (ATR) is a fundamental processing step preceding more complex tasks such as semantic search and ontology learning. From a large number of methodologies ...
141
click to vote
IJCAI
2007
15 years 6 months ago
2007
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...