1162 search results - page 153 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
ICMCS
2009
IEEE
13 years 5 months ago
2009
IEEE
Parallel scalability allows an application to efficiently utilize an increasing number of processing elements. In this paper we explore a design space for parallel scalability for...
AI
2002
Springer
13 years 8 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 ...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
In this article we describe a visual-analytic tool for the interrogation of evolving interaction network data such as those found in social, bibliometric, WWW and biological appli...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...