Sciweavers

295 search results - page 3 / 59
» A New Node Centroid Algorithm for Bandwidth Minimization
Sort
View
ADHOCNOW
2005
Springer
13 years 11 months ago
Heuristic Algorithms for Minimum Bandwith Consumption Multicast Routing in Wireless Mesh Networks
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
Pedro M. Ruiz, Antonio F. Gómez-Skarmeta
LCN
1999
IEEE
13 years 10 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
PAKDD
2010
ACM
198views Data Mining» more  PAKDD 2010»
13 years 10 months ago
A Better Strategy of Discovering Link-Pattern Based Communities by Classical Clustering Methods
Abstract. The definition of a community in social networks varies with applications. To generalize different types of communities, the concept of linkpattern based community was pr...
Chen-Yi Lin, Jia-Ling Koh, Arbee L. P. Chen
HIPC
2005
Springer
13 years 11 months ago
Cost-Optimal Job Allocation Schemes for Bandwidth-Constrained Distributed Computing Systems
Abstract. This paper formulates the job allocation problem in distributed systems with bandwidth-constrained nodes. The bandwidth limitations of the nodes play an important role in...
Preetam Ghosh, Kalyan Basu, Sajal K. Das
ACSC
2003
IEEE
13 years 11 months ago
Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
Xiaodi Huang, Wei Lai