3991 search results - page 516 / 799 » Bounding homogeneous models |
168
click to vote
INFOCOM
2005
IEEE
16 years 12 days ago
2005
IEEE
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
193
click to vote
SWAT
2004
Springer
16 years 4 days ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
155
click to vote
PODC
2003
ACM
16 years 1 days ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
209
click to vote
ESA
2003
Springer
16 years 1 days ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
180
click to vote
FSTTCS
2003
Springer
16 years 21 hour ago
2003
Springer
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...