14 search results - page 2 / 3 » spire 2009 |
161
Voted
SPIRE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper presents a user study that evaluated the effectiveness of an aggregated search interface in the context of non-navigational search tasks. An experimental syst...
137
Voted
SPIRE
2009
Springer
15 years 10 months ago
2009
Springer
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
153
Voted
SPIRE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Term-partitioned indexes are generally inefficient for the evaluation of conjunctive queries, as they require the communication of long posting lists. On the other side, ...
130
Voted
SPIRE
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
123
Voted
SPIRE
2009
Springer
15 years 10 months ago
2009
Springer
The consensus string problem is finding a representative string (consensus) of a given set S of strings. In this paper we deal with the consensus string problems optimizing both d...