466 search results - page 64 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
185
click to vote
CSL
1995
Springer
15 years 9 months ago
1995
Springer
We propose so called contraction free sequent calculi for the three prominent modal logics K, T, and S4. Deduction search in these calculi is shown to provide more efficient decisi...
212
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
186
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
140
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. The paper considers the problem of semi-supervised multiview classification, where each view corresponds to a Reproducing Kernel Hilbert Space. An algorithm based on co-...
156
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...