Sciweavers

1058 search results - page 109 / 212
» Secure Group Communications Using Key Graphs
Sort
View
ISSS
2002
IEEE
125views Hardware» more  ISSS 2002»
15 years 7 months ago
Security-Driven Exploration of Cryptography in DSP Cores
With the popularity of wireless communication devices a new important dimension of embedded systems design has arisen, that of security. This paper presents for the first time des...
Catherine H. Gebotys
117
Voted
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
15 years 2 months ago
Goldberg-Coxeter Construction for 3- and 4-valent Plane Graphs
We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a pla...
Mathieu Dutour, Michel Deza
104
Voted
AI
2009
Springer
15 years 9 months ago
Exploratory Analysis of Co-Change Graphs for Code Refactoring
Abstract. Version Control Systems (VCS) have always played an essential role for developing reliable software. Recently, many new ways of utilizing the information hidden in VCS ha...
Hassan Khosravi, Recep Colak
ACNS
2006
Springer
96views Cryptology» more  ACNS 2006»
15 years 4 months ago
On Optimizing the Security-Throughput Trade-Off in Wireless Networks with Adversaries
In this paper, we model the adversary (eavesdropper) present in the wireless communication medium using probabilistic models. We precisely formulate the security-throughput optimiz...
Mohamed A. Haleem, Chetan Nanjunda Mathur, Rajarat...
108
Voted
JPDC
2006
134views more  JPDC 2006»
15 years 2 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