3630 search results - page 182 / 726 » Fast Marching Methods |
136
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...
224
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic m...
162
click to vote
ICPR
2008
IEEE
16 years 26 days ago
2008
IEEE
In content based image retrieval, the success of any distance-based indexing scheme depends critically on the quality of the chosen distance metric. We propose in this paper a ker...
158
click to vote
ICIP
2007
IEEE
16 years 22 days ago
2007
IEEE
This paper proposes a fast blotch detection algorithm based on a Markov Random Field (MRF) model with less computational load and with lower false alarm rate than the existing MRF...
165
click to vote
ICMCS
2006
IEEE
16 years 14 days ago
2006
IEEE
Multi-reference frame motion estimation improves the accuracy of motion compensation in video compression, but it also dramatically increases computational complexity. Based on tr...