1399 search results - page 79 / 280 » Multi-party Finite Computations |
155
Voted
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
126
Voted
TIT
2011
14 years 10 months ago
2011
—Constellation Constrained (CC) capacity regions of two-user Single-Input Single-Output (SISO) Gaussian Multiple Access Channels (GMAC) are computed for several Non-Orthogonal Mu...
131
Voted
CIE
2008
Springer
15 years 5 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
137
click to vote
ASSETS
2008
ACM
15 years 5 months ago
2008
ACM
This proposal is about a brain-controlled electrically powered wheelchair. The system comprises a brain-computer interface based on steady-state visual evoked potentials and a pro...
142
click to vote
EJC
2008
15 years 3 months ago
2008
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...