1066 search results - page 103 / 214 » Computing Private Set Operations with Linear Complexities |
AAAI
1990
14 years 11 months ago
1990
This paper presents an efficient and homogeneous paradigm for automatic acquisition and recognition of nonparametric shapes. Acquisition time varies from linear to cubic in the nu...
SIGMETRICS
2002
ACM
14 years 9 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
AUSAI
2006
Springer
15 years 1 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...
SIAMSC
2010
14 years 8 months ago
2010
Abstract. A smoothed aggregation multigrid method is presented for the numerical calculation of the stationary probability vector of an irreducible sparse Markov chain. It is shown...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
Performance of many state-of-the-art face recognition (FR) methods deteriorates rapidly, when large in size databases are considered. In this paper, we propose a novel clustering ...