2107 search results - page 42 / 422 » Computing Small Search Numbers in Linear Time |
AUSAI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
In this paper, we present an efficient algorithm for 3D object recognition in presence of clutter and occlusions in noisy, sparse and unsegmented range data. The method uses a robu...
UAI
2004
13 years 9 months ago
2004
The paper introduces mixed networks, a new framework for expressing and reasoning with probabilistic and deterministic information. The framework combines belief networks with con...
INFOCOM
1998
IEEE
13 years 12 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...