3415 search results - page 296 / 683 » Lower bounds on kernelization |
175
click to vote
CCCG
2004
15 years 8 months ago
2004
We establish upper and lower bounds on the number of connected components of lines tangent to four triangles in R3 . We show that four triangles in R3 may admit at least 88 tangent...
206
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
The energy-distortion function (E(D)) for a network is defined as the minimum total energy required to achieve a target distortion D at the receiver without putting any restricti...
183
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Recently, a vector version of Witsenhausen's counterexample was considered and it was shown that in that limit of infinite vector length, certain quantization-based strategie...
148
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...