38 search results - page 7 / 8 » A Novel Approach for Compressing Phylogenetic Trees |
WWW
2007
ACM
14 years 6 months ago
2007
ACM
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...
SIGMOD
1999
ACM
13 years 9 months ago
1999
ACM
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
IEEESCC
2009
IEEE
13 years 3 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...