4131 search results - page 300 / 827 » Compactness in Topology and Computation |
157
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
We explore the idea of evidence accumulation for combining the results of multiple clusterings. Initially, n d-dimensional data is decomposed into a large number of compact cluste...
171
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
This paper presents motion field histograms as a new way of extracting facial features and modeling expressions. Feature are based on local receptive field histograms, which are r...
177
click to vote
DCC
2009
IEEE
16 years 7 months ago
2009
IEEE
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
161
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
165
click to vote
ICIAP
2007
ACM
16 years 6 months ago
2007
ACM
To become robust, a tracking algorithm must be able to support uncertainty and ambiguity often inherently present in the data in form of occlusion and clutter. This comes usually ...