248 search results - page 15 / 50 » Geometrical Probability Covering Algorithm |
SMI
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...
ICPR
2000
IEEE
14 years 24 days ago
2000
IEEE
We present an algorithm for segmentation of traffic scenes that distinguishes moving objects from cast shadows. Three image features at each pixel site are considered: brightness,...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
We propose a modified discrete HMM that includes a feature weighting discrimination component. We assume that the feature space is partitioned into subspaces and that the relevan...
ASUNAM
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
CSDA
2010
13 years 8 months ago
2010
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...