3415 search results - page 126 / 683 » Lower Bounds for Kernelizations |
141
click to vote
KDID
2004
15 years 5 months ago
2004
Abstract. Recent studies demonstrate the usefulness of condensed representations as a semantic compression technique for the frequent itemsets. Especially in inductive databases, c...
123
click to vote
TIT
2008
15 years 4 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
126
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
231
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
149
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
—A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels b...