Indexing Temporal Information for Web Pages
Peiquan Jin, Hong Chen, Xujian Zhao, Xiaowen Li, Lihua Yue (2011)
Computer Science and Information Systems
Similarity:
Peiquan Jin, Hong Chen, Xujian Zhao, Xiaowen Li, Lihua Yue (2011)
Computer Science and Information Systems
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...
Damian Bogdanowicz, Krzysztof Giaro (2013)
International Journal of Applied Mathematics and Computer Science
Similarity:
The Robinson-Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach based on a minimum-weight perfect matching in bipartite graphs,...
Keh-Hsun Chen, Zbigniew W. Ras (1988)
Banach Center Publications
Similarity:
Yunfeng He, Junqing Yu (2010)
Computer Science and Information Systems
Similarity:
Kristína Machová, Miroslav Puszta, František Barčák, Peter Bednár (2006)
Computer Science and Information Systems
Similarity:
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity:
Coloma Ballester, Vicent Caselles, P. Monasse (2010)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
In [CITE], Kronrod proves that the connected components of isolevel sets of a continuous function can be endowed with a tree structure. Obviously, the connected components of upper level sets are an inclusion tree, and the same is true for connected components of lower level sets. We prove that in the case of semicontinuous functions, those trees can be merged into a single one, which, following its use in image processing, we call “tree of shapes”. This permits us to solve a classical...