198 search results - page 32 / 40 » A practical algorithm for constructing oblivious routing sch... |
116
click to vote
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
107
click to vote
JNW
2008
14 years 11 months ago
2008
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
IMC
2009
ACM
15 years 6 months ago
2009
ACM
A flurry of recent work has focused on the performance gains that may be achieved by leveraging the broadcast nature of the wireless channel. In particular, researchers have obse...
110
click to vote
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
124
click to vote
CRYPTO
2011
Springer
13 years 11 months ago
2011
Springer
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...