Sciweavers

CORR
2010
Springer
129views Education» more  CORR 2010»
13 years 9 months ago
ML(n)BiCGStab: Reformulation, Analysis and Implementation
With the help of index functions, we re-derive the ML(n)BiCGStab algorithm in [35] in a more systematic way. There are n ways to define the ML(n)BiCGStab residual vector. Each diff...
Man-Chung Yeung
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 9 months ago
Stochastic Minority on Graphs
Abstract. Cellular automata have been mainly studied for on very regular graphs carrying the cells (like lines or grids) and under synchronous dynamics (all cells update simultaneo...
Jean-Baptiste Rouquier, Damien Regnault, Eric Thie...
CORR
2010
Springer
187views Education» more  CORR 2010»
13 years 9 months ago
Learning in A Changing World: Non-Bayesian Restless Multi-Armed Bandit
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
Haoyang Liu, Keqin Liu, Qing Zhao
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 9 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 9 months ago
Nowhere dense graph classes, stability, and the independence property
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
Hans Adler, Isolde Adler
CORR
2010
Springer
145views Education» more  CORR 2010»
13 years 9 months ago
CAT-generation of ideals
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
Torsten Ueckerdt
CORR
2010
Springer
56views Education» more  CORR 2010»
13 years 9 months ago
The Computational Complexity of Linear Optics
Scott Aaronson, Alex Arkhipov
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 9 months ago
Rigidity of Graph Joins and Hendrickson's Conjecture
Whiteley [9] gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined gr...
Timothy Sun, Chun Ye
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 9 months ago
Online Learning: Beyond Regret
We study online learnability of a wide class of problems, extending the results of [26] to general notions of performance measure well beyond external regret. Our framework simult...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari