Sciweavers

166 search results - page 2 / 34
» Towards a theory of cache-efficient algorithms
Sort
View
NIPS
2004
13 years 6 months ago
Co-Training and Expansion: Towards Bridging Theory and Practice
Co-training is a method for combining labeled and unlabeled data when examples can be thought of as containing two distinct sets of features. It has had a number of practical succ...
Maria-Florina Balcan, Avrim Blum, Ke Yang
PARA
2004
Springer
13 years 10 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...
COLING
1990
13 years 6 months ago
A Computational Approach to Binding Theory
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
Alessandra Giorgi, Fabio Pianesi, Giorgio Satta
ATAL
2005
Springer
13 years 10 months ago
Towards a theory of "local to global" in distributed multi-agent systems (II)
a growing need to study abstract problems in distributed multi-agent systems in a systematic way, as well as to provide a qualitative mathematical framework in which to compare po...
Daniel Yamins
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 5 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous