Sciweavers

4553 search results - page 315 / 911
» Distributed Ranked Search
Sort
View
CIKM
2004
Springer
16 years 3 days ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
ECIR
2007
Springer
15 years 8 months ago
Results Merging Algorithm Using Multiple Regression Models
: This paper describes a new algorithm for merging the results of remote collections in a distributed information retrieval environment. The algorithm makes use only of the ranks o...
Georgios Paltoglou, Michail Salampasis, Maria Satr...
LREC
2010
217views Education» more  LREC 2010»
15 years 8 months ago
Building a Web Corpus of Czech
Large corpora are essential to modern methods of computational linguistics and natural language processing. In this paper, we describe an ongoing project whose aim is to build a l...
Drahomíra "johanka" Spoustová, Miros...
IEICET
2007
142views more  IEICET 2007»
15 years 6 months ago
Detecting Unknown Worms Using Randomness Check
From the appearance of CodeRed and SQL Slammer worm, we have learned that the early detection of worm epidemics is important to reduce the damage caused by their outbreak. One prom...
Hyundo Park, Heejo Lee, Hyogon Kim
ICMLA
2009
15 years 4 months ago
Alive on Back-feed Culprit Identification via Machine Learning
We describe an application of machine learning techniques toward the problem of predicting which network protector switch is the cause of an Alive on Back-Feed (ABF) event in the ...
Bert C. Huang, Ansaf Salleb-Aouissi, Philip Gross