Sciweavers

5608 search results - page 136 / 1122
» On the Theory of Matchgate Computations
Sort
View
PARA
2004
Springer
15 years 7 months ago
Automatic Derivation of Linear Algebra Algorithms with Application to Control Theory
It is our belief that the ultimate automatic system for deriving linear algebra libraries should be able to generate a set of algorithms starting from the mathematical specificati...
Paolo Bientinesi, Sergey Kolos, Robert A. van de G...
CHI
2008
ACM
15 years 2 months ago
Secrets and lies in computer-mediated interaction: theory, methods and design
The keeping of secrets and practicing of deception are commonplace in everyday social interaction. They also serve an important role in encouraging social cohesion. However, for H...
Adam N. Joinson, Jeffrey T. Hancock, Pamela Briggs
MP
2006
110views more  MP 2006»
15 years 1 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
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
15 years 5 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 6 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook