Sciweavers

614 search results - page 21 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
ICPP
2009
IEEE
14 years 2 months ago
Performance Limits of Fair-Access in Underwater Sensor Networks
—This paper investigates fundamental performance limits of medium access control (MAC) protocols for particular underwater multi-hop sensor networks under a fair-access criterion...
Yang Xiao, Miao Peng, John H. Gibson, Geoffrey G. ...
GLOBECOM
2006
IEEE
14 years 1 months ago
Link Performance Bounds in Homogeneous Optically Switched Ring Networks
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
Shujia Gong, Bijan Jabbari
ISPD
1998
ACM
88views Hardware» more  ISPD 1998»
13 years 11 months ago
An efficient technique for device and interconnect optimization in deep submicron designs
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
Jason Cong, Lei He
SOFSEM
2005
Springer
14 years 26 days ago
Discovering Treewidth
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
Hans L. Bodlaender
VMV
2008
151views Visualization» more  VMV 2008»
13 years 8 months ago
Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
Marc Gissler, Matthias Teschner