Sciweavers

1648 search results - page 35 / 330
» On the generation of bicliques of a graph
Sort
View
TIT
2008
106views more  TIT 2008»
14 years 9 months ago
Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
This article describes new theoretical results concerning the general behavior of a Feedback with Carry Shift Register (FCSR) automaton. They help to better understand how the init...
François Arnault, Thierry P. Berger, Marine...
IV
2003
IEEE
92views Visualization» more  IV 2003»
15 years 3 months ago
Visualizing Weighted Edges in Graphs
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...
Peter Rodgers, Paul Mutton
CONTEXT
2003
Springer
15 years 2 months ago
Context Dynamic and Explanation in Contextual Graphs
This paper discusses the dynamic of context through the use of a context-based formalism called contextual graphs that has been initially developed in the SART application for the ...
Patrick Brézillon
PRL
1998
91views more  PRL 1998»
14 years 9 months ago
Genetic operators for hierarchical graph clustering
In this paper we propose an encoding scheme and ad hoc operators for a genetic approach to hierarchical graph clustering. Given a connected graph whose vertices correspond to poin...
Stefano Rizzi
SAC
2002
ACM
14 years 9 months ago
A mobility and traffic generation framework for modeling and simulating ad hoc communication networks
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...
Christopher L. Barrett, Madhav V. Marathe, James P...