Sciweavers

582 search results - page 90 / 117
» What Will Probably Happen
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Password Strength: An Empirical Analysis
—It is a well known fact that user-chosen passwords are somewhat predictable: by using tools such as dictionaries or probabilistic models, attackers and password recovery tools c...
Matteo Dell'Amico, Pietro Michiardi, Yves Roudier
AGI
2011
12 years 11 months ago
Three Hypotheses about the Geometry of Mind
What set of concepts and formalizations might one use to make a practically useful, theoretically rigorous theory of generally intelligent systems? We present a novel perspective m...
Ben Goertzel, Matthew Iklé
IROS
2006
IEEE
202views Robotics» more  IROS 2006»
14 years 1 months ago
Topological characterization of mobile robot behavior
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...
Aurélien Hazan, Frédéric Dave...
PSSE
2004
Springer
14 years 1 months ago
Developing and Reasoning About Probabilistic Programs in pGCL
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
Annabelle McIver, Carroll Morgan
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
13 years 9 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin