Sciweavers

365 search results - page 20 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
CSFW
2005
IEEE
14 years 2 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
IPPS
2007
IEEE
14 years 2 months ago
Security Threat Prediction in a Local Area Network Using Statistical Model
In today’s large and complex network scenario vulnerability scanners play a major role from security perspective by proactively identifying the known security problems or vulner...
Somak Bhattacharya, S. K. Ghosh
ACIVS
2005
Springer
14 years 2 months ago
Object Recognition Using Local Characterisation and Zernike Moments
Abstract. Even if lots of object invariant descriptors have been proposed in the literature, putting them into practice in order to obtain a robust system face to several perturbat...
Anant Choksuriwong, Hélène Laurent, ...
ISCA
2003
IEEE
123views Hardware» more  ISCA 2003»
14 years 1 months ago
Detecting Global Stride Locality in Value Streams
Value prediction exploits localities in value streams. Previous research focused on exploiting two types of value localities, computational and context-based, in the local value h...
Huiyang Zhou, Jill Flanagan, Thomas M. Conte
ICNP
1996
IEEE
14 years 19 days ago
A cooperative congestion management scheme for switched high-speed networks
In a wide-area network with high-speed links, congestion may lead to poor utilization and the degradation of the service provided to the users. This paper presents a Cooperative C...
Andrea F. Lobo, Adarshpal S. Sethi