4926 search results - page 150 / 986 » Two Graph Algorithms On an Associative Computing Model |
131
click to vote
GD
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
151
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
152
click to vote
APWEB
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
150
Voted
VIZSEC
2005
Springer
15 years 10 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
144
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
In this paper we present a novel volumetric shape from silhouette algorithm based on a centripetal pentahedron model. The algorithm first partitions the space with a set of infini...