Sciweavers

117 search results - page 9 / 24
» Why Cryptosystems Fail
Sort
View
FM
2003
Springer
98views Formal Methods» more  FM 2003»
14 years 1 months ago
Generating Counterexamples for Multi-valued Model-Checking
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
Arie Gurfinkel, Marsha Chechik
COMPLEX
2009
Springer
14 years 1 months ago
Complex Multi-modal Multi-level Influence Networks - Affordable Housing Case Study -
Most influence networks are depicted as nodes and links operating in the manner of a feed-forward neural network where both nodes and links appear to be homogenous in their nature....
Patrick Beautement, Christine Brönner
IUI
2000
ACM
14 years 23 days ago
APE: learning user's habits to automate repetitive tasks
The APE (Adaptive Programming Environment) project focuses on applying Machine Learning techniques to embed a software assistant into the VisualWorks Smalltalk interactive program...
Jean-David Ruvini, Christophe Dony
MICCAI
1999
Springer
14 years 20 days ago
Understanding the "Demon's Algorithm": 3D Non-rigid Registration by Gradient Descent
The “Demons Algorithm” in increasingly used for non-rigid registration of 3D medical images. However, if it is fast and usually accurate, the algorithm is based on intuitive id...
Xavier Pennec, Pascal Cachier, Nicholas Ayache
SIGCOMM
1997
ACM
14 years 18 days ago
Automated Packet Trace Analysis of TCP Implementations
We describe tcpanaly, a tool for automatically analyzing a TCP implementation's behavior by inspecting packet traces of the TCP's activity. Doing so requires surmounting...
Vern Paxson