Sciweavers

1923 search results - page 190 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CCS
2005
ACM
15 years 3 months ago
Fast dictionary attacks on passwords using time-space tradeoff
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
Arvind Narayanan, Vitaly Shmatikov
HICSS
2006
IEEE
261views Biometrics» more  HICSS 2006»
15 years 4 months ago
e-Risk Management with Insurance: A Framework Using Copula Aided Bayesian Belief Networks
: e-business organizations are heavily dependent on distributed 24X7 robust information computing systems, for their daily operations. To secure distributed online transactions, th...
Arunabha Mukhopadhyay, Samir Chatterjee, Debashis ...
ENTCS
2008
146views more  ENTCS 2008»
14 years 10 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
ANSOFT
2002
171views more  ANSOFT 2002»
14 years 10 months ago
OPM/Web - Object-Process Methodology for Developing Web Applications
Web applications can be classified as hybrids between hypermedia and information systems. They have a relatively simple distributed architecture from the user viewpoint, but a comp...
Iris Reinhartz-Berger, Dov Dori, Shmuel Katz
ATAL
2006
Springer
15 years 1 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...