Sciweavers

3628 search results - page 648 / 726
» The Decision Diffie-Hellman Problem
Sort
View
SIGCOMM
2009
ACM
14 years 4 months ago
Stable and flexible iBGP
Routing oscillation is highly detrimental. It can decrease performance and lead to a high level of update churn placing unnecessary workload on router the problem is distributed b...
Ashley Flavel, Matthew Roughan
ICC
2008
IEEE
139views Communications» more  ICC 2008»
14 years 4 months ago
Practical Routing and Channel Assignment Scheme for Mesh Networks with Directional Antennas
Abstract— Wireless Mesh Network (WMN) has been recognized as one of the promising technologies to provide wireless broadband access. In addition to the multi-radio multi-channel ...
Wei Zhou, Xi Chen, Daji Qiao
LICS
2008
IEEE
14 years 4 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...
GLOBECOM
2007
IEEE
14 years 4 months ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu
MFCS
2007
Springer
14 years 4 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda