993 search results - page 94 / 199 » The Complexity of Probabilistic EL |
NIPS
2008
14 years 11 months ago
2008
This paper describes a recursive estimation procedure for multivariate binary densities using orthogonal expansions. For d covariates, there are 2d basis coefficients to estimate,...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...
IPSN
2007
Springer
15 years 4 months ago
2007
Springer
This paper describes a sensor network approach to tracking a single object in the presence of static and moving occluders using a network of cameras. To conserve communication ban...
131
click to vote
EUROCRYPT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
AAAI
2010
14 years 11 months ago
2010
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world ta...