Sciweavers

1717 search results - page 299 / 344
» A Computable Spectral Theorem
Sort
View
ICMAS
2000
15 years 1 months ago
Reasoning About Others: Representing and Processing Infinite Belief Hierarchies
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
Sviatoslav Brainov, Tuomas Sandholm
105
Voted
WOA
2000
15 years 1 months ago
Towards Interoperable Mechanized Reasoning Systems: the Logic Broker Architecture
There is a growing interest in the integration of mechanized reasoning systems such as automated theorem provers, computer algebra systems, and model checkers. State-of-the-art re...
Alessandro Armando, Daniele Zini
135
Voted
ICFP
2010
ACM
15 years 1 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
120
Voted
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 17 days ago
Secure Transmission with Multiple Antennas II: The MIMOME Wiretap Channel
The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices a...
Ashish Khisti, Gregory W. Wornell
CORR
2008
Springer
93views Education» more  CORR 2008»
15 years 17 days ago
Succinctness of the Complement and Intersection of Regular Expressions
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
Wouter Gelade, Frank Neven