3415 search results - page 240 / 683 » Lower bounds on kernelization |
180
click to vote
AHSWN
2010
15 years 6 months ago
2010
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
181
click to vote
DATAMINE
2006
15 years 6 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
165
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
162
click to vote
IPL
2007
15 years 6 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
168
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a disc...