2440 search results - page 152 / 488 » Data-Intensive Question Answering |
SFP
2000
13 years 11 months ago
2000
: We describe an algorithm approximatingthe following question: Given two types t1 and t2, are there instances (t1) and (t2) denoting a common element? By answering this question w...
COLING
1990
13 years 11 months ago
1990
In any system for Natural Language Processing having a dictionary, the question arises as to whiclh entries are included in it. In this paper, I address the subquestion as to whet...
ALGORITHMICA
2010
13 years 10 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
AAECC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The paper deals with the question of recognizing the mutual positions of the connected components of a non-singular real projective surface S in the real projective 3-spa...
ORL
2007
13 years 9 months ago
2007
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problem...