Sciweavers

79 search results - page 5 / 16
» Biased Skip Lists
Sort
View
ECIR
2010
Springer
13 years 8 months ago
Aggregation of Multiple Judgments for Evaluating Ordered Lists
Abstract. Many tasks (e.g., search and summarization) result in an ordered list of items. In order to evaluate such an ordered list of items, we need to compare it with an ideal or...
Hyun Duk Kim, ChengXiang Zhai, Jiawei Han
SIGIR
1998
ACM
13 years 11 months ago
Advantages of Query Biased Summaries in Information Retrieval
1 This paper presents an investigation into the utility of document summarisation in the context of information retrieval, more specifically in the application of so called query b...
Anastasios Tombros, Mark Sanderson
PPOPP
2010
ACM
14 years 4 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
GIR
2006
ACM
14 years 1 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
ASPLOS
2009
ACM
14 years 8 months ago
Producing wrong data without doing anything obviously wrong!
This paper presents a surprising result: changing a seemingly innocuous aspect of an experimental setup can cause a systems researcher to draw wrong conclusions from an experiment...
Todd Mytkowicz, Amer Diwan, Matthias Hauswirth, Pe...