Sciweavers

2309 search results - page 176 / 462
» Efficient Topological Exploration
Sort
View
ICPP
1999
IEEE
14 years 17 days ago
The Index-Permutation Graph Model for Hierarchical Interconnection Networks
In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of inter...
Chi-Hsiang Yeh, Behrooz Parhami
CGI
1998
IEEE
14 years 17 days ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
ICNP
1998
IEEE
14 years 16 days ago
Evaluating the Overheads of Source-Directed Quality-of-Service Routing
Quality-of-service (QoS) routing satisfiesapplication performance requirements and optimizes network resource usage but effective path-selection schemes require the distribution o...
Anees Shaikh, Jennifer Rexford, Kang G. Shin
AICCSA
2001
IEEE
200views Hardware» more  AICCSA 2001»
13 years 12 months ago
Location Management in Mobile Computing
This paper presents a novel approach based on clustering algorithms in combination with the location area (LA) scheme to solve the mobility management problem. Users' movemen...
Riky Subrata, Albert Y. Zomaya
CCCG
2010
13 years 9 months ago
Connected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...