18 search results - page 2 / 4 » Fast Message Authentication Using Efficient Polynomial Evalu... |
TCC
2009
Springer
14 years 5 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
WSCG
2004
13 years 6 months ago
2004
This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming th...
SIAMNUM
2010
13 years 3 days ago
2010
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The Trinity [1] spam classification system is based on a distributed hash table that is implemented using a structured peer-to-peer overlay. Such an overlay must be capable of proc...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...