125 search results - page 25 / 25 » An efficient algorithm for incremental mining of temporal as... |
SAC
2002
ACM
13 years 5 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
SIGMOD
2010
ACM
13 years 5 months ago
2010
ACM
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
KDD
2003
ACM
14 years 6 months ago
2003
ACM
A number of medically important disease-causing bacteria (collectively called Gram-negative bacteria) are noted for the extra "outer" membrane that surrounds their cell....
NAR
2007
13 years 5 months ago
2007
The PEDANT genome database provides exhaustive annotation of 468 genomes by a broad set of bioinformatics algorithms. We describe recent developments of the PEDANT Web server. The...
WWW
2009
ACM
14 years 6 months ago
2009
ACM
Users of social networking services can connect with each other by forming communities for online interaction. Yet as the number of communities hosted by such websites grows over ...