3415 search results - page 159 / 683 » Lower Bounds for Kernelizations |
119
click to vote
TCBB
2010
15 years 2 months ago
2010
We show that subtree prune and regraft (uSPR) distance on unrooted trees is fixed parameter tractable with respect to the distance. We also make progress on a conjecture of Steel...
167
Voted
DCG
2011
14 years 11 months ago
2011
We show that any point in the convex hull of each of (d +1) sets of (d +1) points in general position in Rd is contained in at least (d + 1)2/2 simplices with one vertex from each ...
190
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper, we provide a semi-analytical method for predicting the upper and lower bound of the end-to-end mutual information for a relay network with practical codes and diffe...
142
click to vote
ICPP
2009
IEEE
15 years 11 months ago
2009
IEEE
—This paper investigates fundamental performance limits of medium access control (MAC) protocols for particular underwater multi-hop sensor networks under a fair-access criterion...
126
click to vote
TCC
2009
Springer
16 years 5 months ago
2009
Springer
The known secret-sharing schemes for most access structures are not efficient; even for a one-bit secret the length of the shares in the schemes is 2O(n) , where n is the number of...