Sciweavers

9683 search results - page 1365 / 1937
» Predicting query performance
Sort
View
CRITIS
2007
15 years 8 months ago
Detecting DNS Amplification Attacks
DNS amplification attacks massively exploit open recursive DNS servers mainly for performing bandwidth consumption DDoS attacks. The amplification effect lies in the fact that DNS ...
Georgios Kambourakis, Tassos Moschos, Dimitris Gen...
FOIKS
2008
Springer
15 years 8 months ago
A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases
Abstract In this paper we present a new rule-based approach for consistency preserving view updating in deductive databases. Based on rule transformations performed during schema d...
Andreas Behrend, Rainer Manthey
AAAI
2010
15 years 8 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
CCCG
2010
15 years 8 months ago
Fast local searches and updates in bounded universes
Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
ECIR
2010
Springer
15 years 8 months ago
On Improving Pseudo-Relevance Feedback Using Pseudo-Irrelevant Documents
Abstract. Pseudo-Relevance Feedback (PRF) assumes that the topranking n documents of the initial retrieval are relevant and extracts expansion terms from them. In this work, we int...
Karthik Raman, Raghavendra Udupa, Pushpak Bhattach...
« Prev « First page 1365 / 1937 Last » Next »