198 search results - page 27 / 40 » A practical algorithm for constructing oblivious routing sch... |
TMC
2008
14 years 11 months ago
2008
We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-toend connectivity, allowing non-backbone nodes to save energy sin...
109
click to vote
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
TACAS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
EUROCRYPT
2009
Springer
16 years 7 days ago
2009
Springer
We initiate the cryptographic study of order-preserving symmetric encryption (OPE), a primitive suggested in the database community by Agrawal et al. (SIGMOD '04) for allowin...
IACR
2011
13 years 11 months ago
2011
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...