320 search results - page 35 / 64 » Rigorous Result for the CHKNS Random Graph Model |
150
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
165
click to vote
UAI
2004
15 years 7 months ago
2004
Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. ...
154
click to vote
IROS
2007
IEEE
16 years 8 days ago
2007
IEEE
— Intention recognition is an important topic in human-robot cooperation that can be tackled using probabilistic model-based methods. A popular instance of such methods are Bayes...
136
click to vote
ACSAC
2003
IEEE
15 years 11 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
171
click to vote
INFOCOM
2006
IEEE
16 years 15 hour ago
2006
IEEE
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...