1986 search results - page 228 / 398 » Path Separability of Graphs |
131
click to vote
GLOBECOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
130
Voted
ICSE
2008
IEEE-ACM
16 years 2 months ago
2008
IEEE-ACM
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
139
click to vote
ICOIN
2007
Springer
15 years 8 months ago
2007
Springer
Exploring topological structure at Autonomous System (AS) level is indispensable for understanding most issues in Internet services. Previous models of AS graph involve address or ...
110
click to vote
IV
2002
IEEE
15 years 7 months ago
2002
IEEE
We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Sprin...
141
Voted
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...