6615 search results - page 132 / 1323 » Indexing Multiple Sets |
136
Voted
CSMR
2006
IEEE
15 years 11 months ago
2006
IEEE
Managing traceability data is an important aspect of the software development process. In this paper we investigate to what extent latent semantic indexing (LSI), an information r...
110
Voted
BTW
2003
Springer
15 years 10 months ago
2003
Springer
: A recent article introduced partitioned B-trees, in which partitions are defined not in the catalogs but by distinct values in an artificial leading key column. As there usually ...
151
Voted
CIE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
170
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
161
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...