Sciweavers

1000 search results - page 19 / 200
» order 2011
Sort
View
JGT
2011
76views more  JGT 2011»
14 years 6 months ago
Intersections of graphs
Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this paper is to provide som...
Béla Bollobás, Alex D. Scott
JSCIC
2011
76views more  JSCIC 2011»
14 years 6 months ago
Two-Level Additive Schwarz Preconditioners for a Weakly Over-Penalized Symmetric Interior Penalty Method
We propose and analyze several two-level additive Schwarz preconditioners for a weakly over-penalized symmetric interior penalty method for second order elliptic boundary value pro...
A. T. Barker, Susanne C. Brenner, E.-H. Park, Li-Y...
RSA
2011
92views more  RSA 2011»
14 years 6 months ago
Highly nonrepetitive sequences: Winning strategies from the local lemma
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...
Wesley Pegden
TIT
2011
120views more  TIT 2011»
14 years 6 months ago
Deterministic Construction of Binary, Bipolar, and Ternary Compressed Sensing Matrices
—In this paper we establish the connection between the Orthogonal Optical Codes (OOC) and binary compressed sensing matrices. We also introduce deterministic bipolar m × n RIP f...
Arash Amini, Farokh Marvasti
RSA
2011
77views more  RSA 2011»
14 years 6 months ago
Regular induced subgraphs of a random Graph
An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
Michael Krivelevich, Benny Sudakov, Nicholas C. Wo...