Sciweavers

1059 search results - page 199 / 212
» Discovering Sequence Similarity by the Algorithmic Significa...
Sort
View
EDBT
2009
ACM
132views Database» more  EDBT 2009»
14 years 2 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
SIGMOD
2004
ACM
149views Database» more  SIGMOD 2004»
14 years 7 months ago
Incremental Maintenance of XML Structural Indexes
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
Ke Yi, Hao He, Ioana Stanoi, Jun Yang 0001
CVPR
2008
IEEE
14 years 9 months ago
Tensor reduction error analysis - Applications to video compression and classification
Tensor based dimensionality reduction has recently been extensively studied for computer vision applications. To our knowledge, however, there exist no rigorous error analysis on ...
Chris H. Q. Ding, Heng Huang, Dijun Luo
BIOINFORMATICS
2007
137views more  BIOINFORMATICS 2007»
13 years 7 months ago
Annotation-based distance measures for patient subgroup discovery in clinical microarray studies
: Background Clustering algorithms are widely used in the analysis of microarray data. In clinical studies, they are often applied to find groups of co-regulated genes. Clustering...
Claudio Lottaz, Joern Toedling, Rainer Spang
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan