An application of -ary trees to the design of data structures for geometric searching problems
M. Talamo, G. Gambosi (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
M. Talamo, G. Gambosi (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Przemysław Grudziński, Marek Wojciechowski (2009)
Control and Cybernetics
Similarity:
Yunfeng He, Junqing Yu (2010)
Computer Science and Information Systems
Similarity:
Markus E. Nebel (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Michal Krátký, Tomáš Skopal, Václav Snášel (2004)
Kybernetika
Similarity:
The area of Information Retrieval deals with problems of storage and retrieval within a huge collection of text documents. In IR models, the semantics of a document is usually characterized using a set of terms. A common need to various IR models is an efficient term retrieval provided via a term index. Existing approaches of term indexing, e. g. the inverted list, support efficiently only simple queries asking for a term occurrence. In practice, we would like to exploit some more sophisticated...
Peiquan Jin, Hong Chen, Xujian Zhao, Xiaowen Li, Lihua Yue (2011)
Computer Science and Information Systems
Similarity: