Sciweavers

882 search results - page 169 / 177
» On self-embeddings of computable linear orderings
Sort
View
ICPP
2000
IEEE
13 years 11 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
SIGGRAPH
1999
ACM
13 years 11 months ago
LCIS: A Boundary Hierarchy for Detail-Preserving Contrast Reduction
High contrast scenes are difficult to depict on low contrast displays without loss of important fine details and textures. Skilled artists preserve these details by drawing scen...
Jack Tumblin, Greg Turk
CVPR
2005
IEEE
14 years 9 months ago
Efficient Mean-Shift Tracking via a New Similarity Measure
The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color...
Changjiang Yang, Ramani Duraiswami, Larry S. Davis
CVPR
2008
IEEE
14 years 9 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán
ISBI
2008
IEEE
14 years 8 months ago
Chromosome pairing for karyotyping purposes using mutual information
Cytogenetics is the preferred tool in the diagnosis of genetic diseases such as leukemia and detection of aquired chromosomal abnormalities, such as translocations, deletions, mon...
Artem Khmelinskii, João Sanches, Rodrigo Ve...