Sciweavers

50 search results - page 9 / 10
» A Stemming Algorithm for the Farsi Language
Sort
View
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
14 years 13 days ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
AAAI
1994
13 years 7 months ago
Learning to Reason
We introduce a new framework for the study of reasoning. The Learning (in order) to Reason approach developed here views learning as an integral part of the inference process, and ...
Roni Khardon, Dan Roth
CLEF
2009
Springer
13 years 7 months ago
UNIBA-SENSE @ CLEF 2009: Robust WSD Task
This paper presents the participation of the semantic N-levels search engine SENSE at the CLEF 2009 Ad Hoc Robust-WSD Task. During the participation at the same task of CLEF 2008,...
Pierpaolo Basile, Annalina Caputo, Giovanni Semera...
BMCBI
2008
85views more  BMCBI 2008»
13 years 6 months ago
Normalizing biomedical terms by minimizing ambiguity and variability
Background: One of the difficulties in mapping biomedical named entities, e.g. genes, proteins, chemicals and diseases, to their concept identifiers stems from the potential varia...
Yoshimasa Tsuruoka, John McNaught, Sophia Ananiado...
AND
2009
13 years 4 months ago
Accessing the content of Greek historical documents
In this paper, we propose an alternative method for accessing the content of Greek historical documents printed during the 17th and 18th centuries by searching words directly in d...
Anastasios L. Kesidis, Eleni Galiotou, Basilios Ga...