3415 search results - page 117 / 683 » Lower Bounds for Kernelizations |
120
click to vote
DCC
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider symmetric multiple description coding for the Gaussian source, and provide upper and lower bounds for the individual description rate-distortion function. One of the m...
137
click to vote
ALT
2004
Springer
16 years 1 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
127
click to vote
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Co...
118
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are c...
156
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Object segmentation needs to be driven by top-down knowledge to produce semantically meaningful results. In this paper, we propose a supervised segmentation approach that tightly ...