3415 search results - page 147 / 683 » Lower Bounds for Kernelizations |
140
click to vote
CPM
2010
Springer
15 years 9 months ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
128
click to vote
COLT
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We develop three new techniques to build on the recent advances in online learning with kernels. First, we show that an exponential speed-up in prediction time per trial ...
158
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
133
click to vote
EUROPAR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
129
click to vote
CPM
2007
Springer
15 years 8 months ago
2007
Springer
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...