Sciweavers

1700 search results - page 110 / 340
» Combinatorial Pattern Matching
Sort
View
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 11 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
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...
Mirit Shalem, Ziv Bar-Yossef
ACMSE
2009
ACM
14 years 4 months ago
FI-based file access predictor
An algorithm is proposed for the purpose of optimizing the availability of files to an operating system prior to their being required during execution by a running system. This al...
Jinsuk Baek, Paul S. Fisher, Mingyung Kwak
RECOMB
2006
Springer
14 years 10 months ago
Inferring Positional Homologs with Common Intervals of Sequences
Inferring orthologous and paralogous genes is an important problem in whole genomes comparisons, both for functional or evolutionary studies. In this paper, we introduce a new appr...
Guillaume Blin, Annie Chateau, Cedric Chauve, Yann...
DATAMINE
2006
88views more  DATAMINE 2006»
13 years 10 months ago
Hyperclique pattern discovery
Existing algorithms for mining association patterns often rely on the support-based pruning strategy to prune a combinatorial search space. However, this strategy is not effective ...
Hui Xiong, Pang-Ning Tan, Vipin Kumar
SAC
2008
ACM
13 years 9 months ago
Pattern ranking for semi-automatic ontology construction
When developing semantic applications, the construction of ontologies is a crucial part. We are developing a semiautomatic ontology construction approach, OntoCase, relying on ont...
Eva Blomqvist