179 search results - page 23 / 36 » Alternation-Trading Proofs, Linear Programming, and Lower Bo... |
CINQ
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
MFCS
2009
Springer
14 years 2 days ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
STOC
2012
ACM
11 years 10 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
AUTOMATICA
2005
13 years 7 months ago
2005
In this paper we present a new method of interval fuzzy model identification. The method combines a fuzzy identification methodology with some ideas from linear programming theory...
COLT
1999
Springer
13 years 11 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...