Sciweavers

4066 search results - page 11 / 814
» Almost Complete Sets
Sort
View
ARSCOM
2004
104views more  ARSCOM 2004»
13 years 7 months ago
Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...
Klas Markstrom
SIAMSC
2010
104views more  SIAMSC 2010»
13 years 2 months ago
BDDC Preconditioners for Spectral Element Discretizations of Almost Incompressible Elasticity in Three Dimensions
Abstract. BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensi...
Luca F. Pavarino, Olof B. Widlund, Stefano Zampini
DAM
1999
114views more  DAM 1999»
13 years 7 months ago
Perfect and Almost Perfect Sequences
The autocorrelation function of a sequence is a measure for how much the given sequence di ers from its translates. Periodic binary sequences with good correlation properties have...
Dieter Jungnickel, Alexander Pott
COLT
2008
Springer
13 years 9 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 7 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...