Sciweavers

922 search results - page 126 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
TIT
2010
111views Education» more  TIT 2010»
15 years 26 days ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
DLOG
2009
15 years 4 months ago
Testing Provers on a Grid - Framework Description
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
Carlos Areces, Daniel Gorín, Alejandra Lore...
KR
1998
Springer
15 years 10 months ago
AOL: A logic of Acting, Sensing, Knowing, and Only Knowing
This work is motivated by the existence of two useful but quite different knowledge representation formalisms, the situation calculus due to McCarthy, and the logic OL of only kno...
Gerhard Lakemeyer, Hector J. Levesque
CSFW
2010
IEEE
15 years 10 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
CDC
2009
IEEE
144views Control Systems» more  CDC 2009»
15 years 9 months ago
Stochastic control over finite capacity channels: Causality, feedback and uncertainty
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
Charalambos D. Charalambous, Christos K. Kourtella...