686 search results - page 119 / 138 » Packing Cycles in Graphs |
105
click to vote
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
TCC
2007
Springer
15 years 3 months ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
72
Voted
ICPP
1999
IEEE
15 years 1 months ago
1999
IEEE
Most of today's multiprocessors have a DistributedShared Memory (DSM) organization, which enables scalability while retaining the convenience of the shared-memory programming...
ISPAN
1997
IEEE
15 years 1 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
The growing use of digital signal processors (DSPs) in embedded systems necessitates the use of optimizing compilers supporting special hardware features. Due to the irregular arc...