Sciweavers

3415 search results - page 157 / 683
» Lower Bounds for Kernelizations
Sort
View
TSP
2008
103views more  TSP 2008»
15 years 4 months ago
Bounds for Estimation of Covariance Matrices From Heterogeneous Samples
Abstract--This correspondence derives lower bounds on the meansquare error (MSE) for the estimation of a covariance matrix , using samples k = 1; . . . ; K, whose covariance matric...
Olivier Besson, Stéphanie Bidon, Jean-Yves ...
ISAAC
2007
Springer
131views Algorithms» more  ISAAC 2007»
15 years 10 months ago
On the Fault Testing for Reversible Circuits
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on the wires of a reversible circuit. We also show non-trivial lower bounds for the ...
Satoshi Tayu, Shigeru Ito, Shuichi Ueno
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 10 months ago
On Pseudoentropy versus Compressibility
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
Hoeteck Wee
136
Voted
STOC
1995
ACM
114views Algorithms» more  STOC 1995»
15 years 8 months ago
On data structures and asymmetric communication complexity
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi...
151
Voted
AAAI
2008
15 years 6 months ago
Limits and Possibilities of BDDs in State Space Search
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
Stefan Edelkamp, Peter Kissmann