Sciweavers

1089 search results - page 5 / 218
» Bounds on generalized Frobenius numbers
Sort
View
MFCS
2005
Springer
14 years 1 months ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
Petr Kolman
COLT
1993
Springer
13 years 11 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum
MOC
1998
106views more  MOC 1998»
13 years 7 months ago
Bounds for eigenvalues and condition numbers in the p-version of the finite element method
In this paper, we present a theory for bounding the minimum eigenvalues, maximum eigenvalues, and condition numbers of stiffness matrices arising from the p-version of finite ele...
Ning Hu, Xian-Zhong Guo, I. Norman Katz
JCT
2010
114views more  JCT 2010»
13 years 6 months ago
An almost quadratic bound on vertex Folkman numbers
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
Andrzej Dudek, Vojtech Rödl
FOCS
2003
IEEE
14 years 25 days ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen