1716 search results - page 196 / 344 » Proving Conditional Termination |
109
Voted
SIAMCO
2010
14 years 7 months ago
2010
We study a simple continuous-time multiagent system related to Krause's model of opinion dynamics: each agent holds a real value, and this value is continuously attracted by e...
116
Voted
TWC
2010
14 years 7 months ago
2010
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
125
click to vote
CSFW
2012
IEEE
13 years 3 months ago
2012
IEEE
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
106
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
104
Voted
DCC
2007
IEEE
16 years 12 days ago
2007
IEEE
In this paper, we consider lossless transmission of arbitrarily correlated sources over a multiple access channel. Characterization of the achievable rates in the most general set...