Sciweavers

189 search results - page 35 / 38
» Finding algorithms in scientific articles
Sort
View
BMCBI
2008
128views more  BMCBI 2008»
13 years 7 months ago
Nonparametric relevance-shifted multiple testing procedures for the analysis of high-dimensional multivariate data with small sa
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...
Cornelia Frömke, Ludwig A. Hothorn, Siegfried...
DATESO
2007
107views Database» more  DATESO 2007»
13 years 9 months ago
Work with Knowledge on the Internet - Local Search
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...
Antonin Pavlicek, Josef Muknsnabl
DATESO
2008
131views Database» more  DATESO 2008»
13 years 9 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
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...
Michal Krátký, Radim Baca
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 7 months ago
TASM: Top-k Approximate Subtree Matching
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...
IPPS
2003
IEEE
14 years 27 days ago
Approximate Search Engine Optimization for Directory Service
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...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee