1819 search results - page 197 / 364 » Computability and Representations of the Zero Set |
188
click to vote
PAMI
2006
15 years 6 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
185
click to vote
TIP
2002
15 years 6 months ago
2002
In this paper, we introduce a rotational invariant feature set for texture segmentation and classification, based on an extension of fractal dimension (FD) features. The FD extract...
156
click to vote
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
Typically, users interact with database systems by formulating queries. However, many times users do not have a clear understanding of their information needs or the exact content...
182
click to vote
VISUALIZATION
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper describes a set of techniques developed for the visualization of high-resolution volume data generated from industrial computed tomography for nondestructive testing (N...
187
click to vote
ICCV
2005
IEEE
16 years 4 days ago
2005
IEEE
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...