Sciweavers

1132 search results - page 55 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
SAT
2005
Springer
122views Hardware» more  SAT 2005»
15 years 5 months ago
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
Maher N. Mneimneh, Inês Lynce, Zaher S. Andr...
NIPS
2003
15 years 1 months ago
Sparseness of Support Vector Machines---Some Asymptotically Sharp Bounds
The decision functions constructed by support vector machines (SVM’s) usually depend only on a subset of the training set—the so-called support vectors. We derive asymptotical...
Ingo Steinwart
TIT
2002
146views more  TIT 2002»
14 years 11 months ago
Bounds on the performance of belief propagation decoding
We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-ou...
David Burshtein, Gadi Miller
AAAI
2008
15 years 2 months ago
Limits and Possibilities of BDDs in State Space Search
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
Stefan Edelkamp, Peter Kissmann
ICASSP
2011
IEEE
14 years 3 months ago
Analyzing the performance of error-prone relay networks
In this paper, we provide a semi-analytical method for predicting the upper and lower bound of the end-to-end mutual information for a relay network with practical codes and diffe...
Sebastian Vorköper, Volker Kühn