In this paper, we describe an approach based on off-the-shelf parsers and semantic resources for the Recognizing Textual Entailment (RTE) challenge that can be generally applied t...
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H....
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Abstract. For casual web users, a natural language is more accessible than formal query languages. However, understanding of a natural language query is not trivial for computer sy...
Tae-Gil Noh, Yong-Jin Han, Seong-Bae Park, Se-Youn...
While subjectivity related research in other languages has increased, most of the work focuses on single languages. This paper explores the integration of features originating fro...