Sciweavers

157 search results - page 21 / 32
» On indexing error-tolerant set containment
Sort
View
CLEF
2006
Springer
15 years 9 months ago
A High Precision Information Retrieval Method for WiQA
This paper presents Wolverhampton University's participation in the WiQA competition. The method chosen for this task combines a high precision, but low recall information re...
Constantin Orasan, Georgiana Puscasu
DC
2001
15 years 7 months ago
Metadata for Evidence Based Medicine resources
A new metadata element set based on Dublin Core Metadata Element Set (DC) and AdminCore: Administrative Container Core (A-Core) was proposed for Evidence Based Medicine (EBM) sour...
Yukiko Sakai
DEXAW
2010
IEEE
150views Database» more  DEXAW 2010»
15 years 7 months ago
Search Strategies for Keyword-based Queries
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects userdefined bounds on the number of returned hits. We assume a real-world...
Matthias Hagen, Benno Stein
TOIS
2002
97views more  TOIS 2002»
15 years 5 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
16 years 19 days ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...