3415 search results - page 155 / 683 » Lower Bounds for Kernelizations |
142
click to vote
STOC
1997
ACM
15 years 8 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
155
click to vote
NIPS
2001
15 years 6 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
150
click to vote
PIMRC
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider a point-to-point, correlated and block fading multiple antenna channel where the receiver has a noisy channel estimation and the transmitter has the statistics of the c...
148
click to vote
GLOBECOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—In this paper, we manage to prove the log-concavity of the generalized Marcum Q-function Qν (a, b) with respect to its order ν on [1, ∞). The proof relies on a powerful math...
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...