Sciweavers

14 search results - page 2 / 3
» Pitfalls in computing with pseudorandom determinants
Sort
View
NDSS
2003
IEEE
14 years 3 months ago
Access Control Based on Execution History
Security is a major, frequent concern in extensible software systems such as Java Virtual Machines and the Common Language Runtime. These systems aim to enable simple, classic app...
Martín Abadi, Cédric Fournet
AINA
2009
IEEE
13 years 7 months ago
Approximating Travel Times Using Opportunistic Networking
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
Rudi Ball, Naranker Dulay
PPDP
2005
Springer
14 years 3 months ago
Self-tuning resource aware specialisation for prolog
The paper develops a self-tuning resource aware partial evaluation technique for Prolog programs, which derives its own control strategies tuned for the underlying computer archit...
Stephen-John Craig, Michael Leuschel
STACS
2012
Springer
12 years 5 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...
ICCV
1995
IEEE
14 years 1 months ago
Recognition Using Region Correspondences
Recognition systems attempt to recover information about the identity of observed objects and their location in the environment. A fundamental problem in recognition is pose estima...
Ronen Basri, David W. Jacobs