Sciweavers

922 search results - page 3 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
CDC
2010
IEEE
119views Control Systems» more  CDC 2010»
12 years 12 months ago
Multichannel small-gain theorems for large scale networked systems
We consider large scale interconnected systems where some of the interconnections are characterized by uncertain bounded delays. The delays may for instance be due to a communicati...
Rudolf Sailer, Fabian Wirth
TCC
2010
Springer
121views Cryptology» more  TCC 2010»
13 years 2 months ago
An Efficient Parallel Repetition Theorem
Abstract. We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness e...
Johan Håstad, Rafael Pass, Douglas Wikstr&ou...
PAMI
2012
11 years 7 months ago
Sparse Algorithms Are Not Stable: A No-Free-Lunch Theorem
Abstract—We consider two desired properties of learning algorithms: sparsity and algorithmic stability. Both properties are believed to lead to good generalization ability. We sh...
Huan Xu, Constantine Caramanis, Shie Mannor
APAL
2011
13 years 18 hour ago
Dichotomy theorems for countably infinite dimensional analytic hypergraphs
Abstract. We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic numbe...
Benjamin D. Miller
ICASSP
2011
IEEE
12 years 8 months ago
A general framework for robust HOSVD-based indexing and retrieval with high-order tensor data
In this paper, we rst present a theorem that HOSVD-based representation of high-order tensor data provides a robust framework that can be used for a uni ed representation of the H...
Qun Li, Xiangqiong Shi, Dan Schonfeld