31 search results - page 3 / 7 » Fast and practical instruction-set randomization for commodi... |
TSP
2008
13 years 4 months ago
2008
Abstract-- Simple and efficient computational algorithms for nonparametric wavelet-based identification of nonlinearities in Hammerstein systems driven by random signals are propos...
STOC
1997
ACM
13 years 8 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
EUROSYS
2010
ACM
14 years 1 months ago
2010
ACM
Bugs in concurrent programs are extremely difficult to find and fix during testing. In this paper, we propose Kivati, which can efficiently detect and prevent atomicity violat...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...