Sciweavers

12459 search results - page 2289 / 2492
» cans 2006
Sort
View
CF
2011
ACM
14 years 7 months ago
SIFT: a low-overhead dynamic information flow tracking architecture for SMT processors
Dynamic Information Flow Tracking (DIFT) is a powerful technique that can protect unmodified binaries from a broad range of vulnerabilities such as buffer overflow and code inj...
Meltem Ozsoy, Dmitry Ponomarev, Nael B. Abu-Ghazal...
IJON
2007
120views more  IJON 2007»
15 years 7 months ago
Comparison of dynamical states of random networks with human EEG
Existing models of EEG have mainly focused on relations to network dynamics characterized by firing rates [L. de Arcangelis, H.J. Herrmann, C. Perrone-Capano, Activity-dependent ...
Ralph Meier, Arvind Kumar, Andreas Schulze-Bonhage...
JSYML
2010
114views more  JSYML 2010»
15 years 5 months ago
The Ackermann functions are not optimal, but by how much?
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
Harold Simmons
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
13 years 9 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...
EUROSYS
2006
ACM
16 years 4 months ago
Experiences in building and operating ePOST, a reliable peer-to-peer application
Peer-to-peer (p2p) technology can potentially be used to build highly reliable applications without a single point of failure. However, most of the existing applications, such as ...
Alan Mislove, Ansley Post, Andreas Haeberlen, Pete...
« Prev « First page 2289 / 2492 Last » Next »