621 search results - page 64 / 125 » Efficient algorithms for minimizing tree pattern queries |
RECOMB
2007
Springer
14 years 8 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
PRIS
2004
13 years 9 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
VLDB
2004
ACM
14 years 8 months ago
2004
ACM
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
CISS
2007
IEEE
13 years 12 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...