3415 search results - page 186 / 683 » Lower bounds on kernelization |
144
click to vote
WDAG
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
142
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
136
click to vote
COLT
2008
Springer
15 years 7 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
141
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We investigate the multipath fading relay channel in the limit of a large bandwidth, and in the non-coherent setting, where the channel state is unknown to all terminals, including...
148
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...