Sciweavers

20 search results - page 4 / 4
» Another Look at Complementation Properties
Sort
View
SIMVIS
2003
13 years 6 months ago
An Experimental Study of the Behaviour of the Proxel-Based Simulation Algorithm
The paradigm of the proxel ("probability element") was recently introduced in order to provide a new algorithmic approach to analysing discrete-state stochastic models s...
Sanja Lazarova-Molnar, Graham Horton
SPW
2004
Springer
13 years 10 months ago
One User, Many Hats; and, Sometimes, No Hat: Towards a Secure Yet Usable PDA
How can we design a PDA that is at the same time secure and usable? In current implementations the two properties are mutually exclusive. Because normal users find password entry ...
Frank Stajano
CCS
2005
ACM
13 years 11 months ago
Obfuscated databases and group privacy
We investigate whether it is possible to encrypt a database and then give it away in such a form that users can still access it, but only in a restricted way. In contrast to conve...
Arvind Narayanan, Vitaly Shmatikov
ASPLOS
1996
ACM
13 years 9 months ago
A Quantitative Analysis of Loop Nest Locality
This paper analyzes and quantifies the locality characteristics of numerical loop nests in order to suggest future directions for architecture and software cache optimizations. Si...
Kathryn S. McKinley, Olivier Temam
SODA
2012
ACM
213views Algorithms» more  SODA 2012»
11 years 8 months ago
Expanders are universal for the class of all spanning trees
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...