Sciweavers

945 search results - page 155 / 189
» Robust Text Processing in Automated Information Retrieval
Sort
View
EDBT
2010
ACM
155views Database» more  EDBT 2010»
13 years 12 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
CIKM
2011
Springer
12 years 8 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke
SIGMOD
2007
ACM
172views Database» more  SIGMOD 2007»
14 years 8 months ago
Auditing disclosure by relevance ranking
Numerous widely publicized cases of theft and misuse of private information underscore the need for audit technology to identify the sources of unauthorized disclosure. We present...
Rakesh Agrawal, Alexandre V. Evfimievski, Jerry Ki...
SPIRE
2009
Springer
14 years 3 months ago
A Two-Level Structure for Compressing Aligned Bitexts
A bitext, or bilingual parallel corpus, consists of two texts, each one in a different language, that are mutual translations. Bitexts are very useful in linguistic engineering bec...
Joaquín Adiego, Nieves R. Brisaboa, Miguel ...
ELPUB
2006
ACM
14 years 2 months ago
Knowledge-Based Search in Collections of Digitized Manuscripts: First Results
The paper presents in brief a methodology for development of tools for knowledge-based search in repositories of digitized manuscripts. It is designated to assist the search activ...
Pavel Pavlov, Maria Nisheva-Pavlova