Sciweavers

2440 search results - page 219 / 488
» Data-Intensive Question Answering
Sort
View
COMBINATORICA
2011
14 years 4 months ago
Binary subtrees with few labeled paths
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
Rodney G. Downey, Noam Greenberg, Carl G. Jockusch...
EPART
2011
103views more  EPART 2011»
14 years 4 months ago
Towards a Structured Online Consultation Tool
Abstract. The Structured Online Consultation tool (SCT) is a component tool in the IMPACT Project which is used to construct and present detailed surveys that solicit feedback from...
Adam Zachary Wyner, Katie Atkinson, Trevor J. M. B...
FCS
2006
15 years 5 months ago
Principles of Optimal Probabilistic Decision Tree Construction
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina,...
NAACL
2003
15 years 5 months ago
Japanese Named Entity Extraction with Redundant Morphological Analysis
Named Entity (NE) extraction is an important subtask of document processing such as information extraction and question answering. A typical method used for NE extraction of Japan...
Masayuki Asahara, Yuji Matsumoto
WEBI
2010
Springer
15 years 2 months ago
Using Relational Similarity between Word Pairs for Latent Relational Search on the Web
Latent relational search is a new search paradigm based on the degree of analogy between two word pairs. A latent relational search engine is expected to return the word Paris as a...
Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishiz...