نتایج جستجو برای: question matching

تعداد نتایج: 327134  

Journal: :Astronomy and Astrophysics 2023

Catalogs with celestial positions and uncertainties are among the primary data products of observational astronomy. Consequently, (cross-)matching problem, namely, question how many (and which) pairs pertain to same source, remains a central part this scientific exploitation. We address matching problem for two catalogs from purely geometric point view by adopting concept processes nearest-neig...

2014
Ang Li Vlad I. Morariu Larry S. Davis

Image based geolocation aims to answer the question: where was this ground photograph taken? We present an approach to geolocalating a single image based on matching human delineated line segments in the ground image to automatically detected line segments in ortho images. Our approach is based on distance transform matching. By observing that the uncertainty of line segments is non-linearly am...

2015
Liang Yi Jianxiang Wang Man Lan

This paper reports our submissions to community question answering task in SemEval2015, which consists of two subtasks: (1) predict the quality of answers to given question as good, bad, or potentially relevant and (2) identify yes, no or unsure response to a given YES/NO question based on the good answers identified by subtask 1. For both subtasks, we adopted supervised classification method a...

2003
Steven L. Lytinen Noriko Tomuro

FAQFinder is a Web-based, natural language question-answering system. It answers a user’s question by searching the Usenet Frequently Asked Questions (FAQ) files for a similar FAQ question, and displaying its answer to the user. To find the most similar FAQ question, FAQFinder measures similarity in part by using WordNet (Miller, 1990). To increase the accuracy of the similarity metric, we have...

2011
S. Kalaivani K. Duraiswamy

This paper proposed the architecture of question answering system for a specific domain using semantic web andontology. It defines the question answering system using semantic searching methodology and natural language processing techniques. The traversal in ontology is based upon conceptual graph matching type. The repositories are the collection of documents which hold the information related...

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

2006
Michael Krüger Harald Hempel

In this paper we show that the Inverse problems of HAMILTONIAN CYCLE and 3D-MATCHING are coNP complete. This completes the study of inverse problems of the six natural NP-complete problems from [GJ79] and answers an open question from [Ch03]. We classify the inverse complexity of the natural verifier for HAMILTONIAN CYCLE and 3D-MATCHING by showing coNP-completeness of the corresponding inverse...

2002
Anne Diekema Jiangping Chen Nancy J. McCracken Necati Ercan Ozgencil Mary D. Taffet Ozgur Yilmazel Elizabeth D. Liddy

This paper describes the retrieval experiments for the main task and list task of the TREC-2002 question-answering track. The question answering system described automatically finds answers to questions in a large document collection. The system uses a two-stage retrieval approach to answer finding based on matching of named entities, linguistic patterns, keywords, and the use of a new inferenc...

2002
Kyung-Soon Lee Jae-Ho Kim Key-Sun Choi

This paper describes a Korean Question Answering (KorQuA) system. For flexible text retrieval, we represent terms in a question as five data types, and retrieve passages by matching terms according to these data types. In answer extraction, we filter non-fact answers with negative or uncertain contexts, and interpret a relative expression as an absolute date answer for date type question. Throu...

Journal: :J. Comput. Syst. Sci. 2001
Jay Sethuraman Chung-Piaw Teo

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) results for the bistable marriage and roommates problem become transparent using the polyhedral approac...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید