Sciweavers

17329 search results - page 125 / 3466
» Improved non-approximability results
Sort
View
IJCAI
2003
13 years 10 months ago
Improving Word Sense Disambiguation in Lexical Chaining
Previous algorithms to compute lexical chains suffer either from a lack of accuracy in word sense disambiguation (WSD) or from computational inefficiency. In this paper, we presen...
Michel Galley, Kathleen McKeown
DEEC
2005
IEEE
14 years 2 months ago
Using Semantic Information to Improve Transparent Query Caching for Dynamic Content Web Sites
In this paper, we study the use of semantic information to improve performance of transparent query caching for dynamic content web sites. We observe that in dynamic content web a...
Gokul Soundararajan, Cristiana Amza
MEDINFO
2007
13 years 10 months ago
Using Discourse Analysis to Improve Text Categorization in MEDLINE
PROBLEM: Automatic keyword assignment has been largely studied in medical informatics in the context of the MEDLINE database, both for helping search in MEDLINE and in order to pr...
Patrick Ruch, Antoine Geissbühler, Julien Gob...
BMCBI
2008
122views more  BMCBI 2008»
13 years 9 months ago
ESLpred2: improved method for predicting subcellular localization of eukaryotic proteins
Background: The expansion of raw protein sequence databases in the post genomic era and availability of fresh annotated sequences for major localizations particularly motivated us...
Aarti Garg, Gajendra P. S. Raghava
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
13 years 10 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...