198 search results - page 3 / 40 » A practical algorithm for constructing oblivious routing sch... |
CCCG
2006
13 years 7 months ago
2006
We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work als...
CAGD
2008
13 years 6 months ago
2008
In this paper we present a robust approach to construct a map between two triangulated meshes, M and M' of arbitrary and possibly unequal genus. We introduce a novel initial ...
ICC
2008
IEEE
14 years 18 days ago
2008
IEEE
—Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing pl...
ICPADS
1998
IEEE
13 years 10 months ago
1998
IEEE
The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer accordingt...
EUROCRYPT
2007
Springer
14 years 9 days ago
2007
Springer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...