1923 search results - page 333 / 385 » Modeling Complexity in Secure Distributed Computing |
ESORICS
2009
Springer
15 years 10 months ago
2009
Springer
Separation of Duty Constraints David Basin1 , Samuel J. Burri1,2 , and G?unter Karjoth2 1 ETH Zurich, Department of Computer Science, Switzerland 2 IBM Research, Zurich Research La...
SASN
2006
ACM
15 years 3 months ago
2006
ACM
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
SIGIR
2011
ACM
14 years 15 days ago
2011
ACM
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
109
click to vote
SIAMCOMP
2012
13 years 3 days ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...