54 search results - page 9 / 11 » A comparison of vertex ordering algorithms for large graph v... |
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
This work aims a two-fold contribution: it presents a software to analyse logfiles and visualize popular web hot spots and, additionally, presents an algorithm to use this informa...
BMCBI
2005
13 years 7 months ago
2005
Background: The most common method of identifying groups of functionally related genes in microarray data is to apply a clustering algorithm. However, it is impossible to determin...
AI
2002
Springer
13 years 7 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...