Sciweavers

556 search results - page 43 / 112
» An Abstract Reduction Model for Computer Security Risk
Sort
View
135
Voted
WWW
2008
ACM
16 years 4 months ago
Computable social patterns from sparse sensor data
We present a computational framework to automatically discover high-order temporal social patterns from very noisy and sparse location data. We introduce the concept of social foo...
Dinh Q. Phung, Brett Adams, Svetha Venkatesh
119
Voted
ASIACRYPT
2005
Springer
15 years 9 months ago
Privacy-Preserving Graph Algorithms in the Semi-honest Model
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...
Justin Brickell, Vitaly Shmatikov
137
Voted
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 3 months ago
Modeling Adversaries in a Logic for Security Protocol Analysis
Logics for security protocol analysis require the formalization of an adversary model that specifies the capabilities of adversaries. A common model is the Dolev-Yao model, which c...
Joseph Y. Halpern, Riccardo Pucella
SDM
2008
SIAM
165views Data Mining» more  SDM 2008»
15 years 4 months ago
On the Dangers of Cross-Validation. An Experimental Evaluation
Cross validation allows models to be tested using the full training set by means of repeated resampling; thus, maximizing the total number of points used for testing and potential...
R. Bharat Rao, Glenn Fung
101
Voted
ACG
2003
Springer
15 years 8 months ago
Opponent-Model Search in Bao: Conditions for a Successful Application
Abstract Opponent-Model search is a game-tree search method that explicitly uses knowledge of the opponent. There is some risk involved in using Opponent-Model search. Both the pre...
H. H. L. M. Donkers, H. Jaap van den Herik, Jos W....