59 search results - page 5 / 12 » RE-tree: an efficient index structure for regular expression... |
HPCA
2004
IEEE
14 years 9 months ago
2004
IEEE
Many current programmable architectures designed to exploit data parallelism require computation to be structured to operate on sequentially accessed vectors or streams of data. A...
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...
ESOP
2000
Springer
14 years 5 days ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
MICRO
2000
IEEE
14 years 28 days ago
2000
IEEE
Many data-parallel applications, including emerging media applications, have regular structures that can easily be expressed as a series of arithmetic kernels operating on data st...
ICMLA
2010
13 years 6 months ago
2010
Gene expression (microarray) data have been used widely in bioinformatics. The expression data of a large number of genes from small numbers of subjects are used to identify inform...