260 search results - page 49 / 52 » Compression of Compound Documents |
112
Voted
SPIRE
2005
Springer
15 years 2 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
FSE
2010
Springer
15 years 2 months ago
2010
Springer
ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design. Previous analysis showed some non-randomn...
INFOCOM
1999
IEEE
15 years 1 months ago
1999
IEEE
- This paper suggests that since web browsing is an interactive process and downloading a web page can take several seconds to several minutes over slow links, the information pres...
92
Voted
SCCC
1998
IEEE
15 years 1 months ago
1998
IEEE
We present a scalable algorithm for the parallel computation of inverted files for large text collections. The algorithm takes into account an environment of a high bandwidth netw...
EXPCS
2007
15 years 1 months ago
2007
Utility programs, which perform similar and largely independent operations on a sequence of inputs, include such common applications as compilers, interpreters, and document parse...