Background: In many research areas it is necessary to find differences between treatment groups with several variables. For example, studies of microarray data seek to find a sign...
Authors are looking within their research grant new original web local search algorithm respecting specifics of Czech national environment. We would like to initiate further debate...
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...