Sciweavers

537 search results - page 30 / 108
» A new upper bound for 3-SAT
Sort
View
123
Voted
GLOBECOM
2008
IEEE
15 years 8 months ago
Tight Bounds of the Generalized Marcum Q-Function Based on Log-Concavity
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...
Yin Sun, Shidong Zhou
113
Voted
COLT
2000
Springer
15 years 6 months ago
Computable Shell Decomposition Bounds
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
John Langford, David A. McAllester
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 5 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
114
Voted
MP
2006
88views more  MP 2006»
15 years 1 months ago
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
Dimitris Bertsimas, Constantine Caramanis
92
Voted
MFCS
2009
Springer
15 years 8 months ago
Bounds on Non-surjective Cellular Automata
Abstract. Cellular automata (CA) are discrete, homogeneous dynamical systems. Non-surjective one-dimensional CA have nite words with no preimage (called orphans), pairs of dieren...
Jarkko Kari, Pascal Vanier, Thomas Zeume