Sciweavers

1399 search results - page 127 / 280
» Multi-party Finite Computations
Sort
View
MP
2006
110views more  MP 2006»
15 years 4 months ago
Robust game theory
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...
Michele Aghassi, Dimitris Bertsimas
APAL
2002
73views more  APAL 2002»
15 years 3 months ago
The sequentially realizable functionals
We consider a notion of sequential functional of finite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" an...
John Longley
SIAMSC
2008
134views more  SIAMSC 2008»
15 years 3 months ago
Efficient Solution of Anisotropic Lattice Equations by the Recovery Method
In a recent paper, the authors introduced the recovery method resp. local energy matching principle for solving large systems of lattice equations. The idea is to construct a part...
Ivo Babuska, S. A. Sauter
ICALP
2009
Springer
16 years 4 months ago
Factoring Groups Efficiently
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
Neeraj Kayal, Timur Nezhmetdinov
DCC
2006
IEEE
16 years 3 months ago
Applications of representation theory to wireless communications
In this paper we demonstrate a new and original way to apply the representation theory of finite groups to the development of space-time codes for use in multiple antenna wireless ...
Ali Miri, Monica Nevins, Terasan Niyomsataya