2883 search results - page 97 / 577 » Algorithms for merged indexes |
BIRTHDAY
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...
ERCIMDL
2001
Springer
14 years 2 months ago
2001
Springer
In this paper we describe a way to enhance existing digital library documents by adding links without modifying the stored documents themselves. We show how to use a combination of...
SIGIR
2005
ACM
14 years 3 months ago
2005
ACM
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
DAC
2006
ACM
14 years 11 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
ICFP
1997
ACM
14 years 1 months ago
1997
ACM
An interprocedural flow analysis can justify inlining in higher-order languages. In principle, more inlining can be performed as analysis accuracy improves. This paper compares fo...