Sciweavers

1528 search results - page 95 / 306
» On Signatures for Communication Graphs
Sort
View
CEAS
2005
Springer
14 years 3 months ago
Comparative Graph Theoretical Characterization of Networks of Spam
Email is an increasingly important and ubiquitous means of communication, both facilitating contact between individuals and enabling rises in the productivity of organizations. Ho...
Luíz Henrique Gomes, Rodrigo B. Almeida, Lu...
PIMRC
2010
IEEE
13 years 8 months ago
Frame delay distribution analysis of IEEE 802.11 networks using Signal Flow Graphs
Frame delay variance in CSMA/CA networks is large. Wireless applications may require both, limited mean delay and limited delay jitter. These parameters can be derived easily from ...
Ralf Jennen, Sebastian Max, Bernhard Walke
WADS
2001
Springer
124views Algorithms» more  WADS 2001»
14 years 2 months ago
Deciding Clique-Width for Graphs of Bounded Tree-Width
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
Wolfgang Espelage, Frank Gurski, Egon Wanke
NIPS
2004
13 years 11 months ago
Distributed Information Regularization on Graphs
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expres...
Adrian Corduneanu, Tommi Jaakkola
JPDC
2006
134views more  JPDC 2006»
13 years 10 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong