Sciweavers

2485 search results - page 163 / 497
» A Communicating Tree Model for Generating Network Applicatio...
Sort
View
116
Voted
JPDC
2006
134views more  JPDC 2006»
15 years 3 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
107
Voted
ECEASST
2008
91views more  ECEASST 2008»
15 years 3 months ago
Graph Transformation Model of a Triangulated Network of Mobile Units
Abstract: A triangulated network of mobile units is modelled by means of a graph transformation system in which graph nodes are labelled with geometric coordinates and edges are la...
Stefan Gruner
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
15 years 8 months ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi
IWCMC
2009
ACM
15 years 10 months ago
A cognitive radio system for home theatre "5+1 audio" surround applications
This paper presents the application of cognitive algorithm for a stream diffusion in home theatre “5+1 audio” surround applications. We develop a wavelet-based method to effic...
Valeria Orani, Vlad Popescu, Maurizio Murroni
126
Voted
ISCC
2005
IEEE
130views Communications» more  ISCC 2005»
15 years 9 months ago
Fair and Efficient Frame-Based Scheduling Algorithm for Multimedia Networks
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model...
T. Al-Khasib, Hussein M. Alnuweiri, Hossam Fattah,...