Sciweavers

1528 search results - page 70 / 306
» On Signatures for Communication Graphs
Sort
View
INFOCOM
2012
IEEE
11 years 10 months ago
Low-stretch greedy embedding heuristics
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
Andrej Cvetkovski, Mark Crovella
JGAA
2000
89views more  JGAA 2000»
13 years 7 months ago
Dynamic WWW Structures in 3D
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...
Ulrik Brandes, Vanessa Kääb, Andres L&ou...
JGAA
2007
88views more  JGAA 2007»
13 years 7 months ago
Dynamic Spectral Layout with an Application to Small Worlds
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principl...
Ulrik Brandes, Daniel Fleischer, Thomas Puppe
IFIP
2007
Springer
14 years 1 months ago
A Door Access Control System with Mobile Phones
Abstract. This paper proposes a door access control system with mobile phones which allows off-line delegations of an access. A model of door access control with mobile phones is ...
Tomomi Yamasaki, Toru Nakamura, Kensuke Baba, Hiro...
AMC
2005
188views more  AMC 2005»
13 years 7 months ago
An efficient signcryption scheme with forward secrecy based on elliptic curve
An efficient signcryption scheme based on elliptic curve is proposed in this paper. The signcryption scheme combines digital signature and encryption functions. The proposed schem...
Ren-Junn Hwang, Chih-Hua Lai, Feng-Fu Su