953 search results - page 8 / 191 » On the Pagination of Complex Documents |
SODA
2000
ACM
13 years 9 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
We propose a new, very low complexity, single-pass, algorithm for compression of continuous tone compound documents, known as GRAFIT (GuaRAnteed FIT) that can guarantee a minimum ...
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
Research and development of information access technology for scanned paper documents has been hampered by the lack of public test collections of realistic scope and complexity. A...
EDBTW
2004
Springer
14 years 1 months ago
2004
Springer
While there are many proposals for path indexes on XML documents, none of them is perfectly suited for indexing large-scale collections of interlinked XML documents. Existing strat...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...