3415 search results - page 149 / 683 » Lower Bounds for Kernelizations |
137
click to vote
CSDA
2006
15 years 4 months ago
2006
: Kernel density estimation for multivariate data is an important technique that has a wide range of applications. However, it has received significantly less attention than its un...
155
click to vote
IPCO
1993
15 years 5 months ago
1993
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
165
click to vote
AMW
2009
15 years 5 months ago
2009
We investigate the space requirements for summaries needed for maintaining exact answers to aggregate queries over histories of relational databases. We show that, in general, a su...
154
click to vote
JACM
2006
15 years 4 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
174
click to vote
LICS
2012
IEEE
13 years 7 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...