Sciweavers

321 search results - page 31 / 65
» Partitioning by iterative deletion
Sort
View
186
Voted
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
15 years 7 months ago
A Robust Seedless Algorithm for Correlation Clustering
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
Mohammad S. Aziz, Chandan K. Reddy
151
Voted
ICASSP
2011
IEEE
14 years 9 months ago
Outlier-aware robust clustering
Clustering is a basic task in a variety of machine learning applications. Partitioning a set of input vectors into compact, wellseparated subsets can be severely affected by the p...
Pedro A. Forero, Vassilis Kekatos, Georgios B. Gia...
TCS
2010
15 years 4 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
ICIP
2002
IEEE
16 years 7 months ago
Packet loss protection of embedded data with fast local search
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...
Vladimir Stankovic, Raouf Hamzaoui, Zixiang Xiong
ICIP
1998
IEEE
16 years 7 months ago
An Efficient Mutual Information Optimizer for Multiresolution Image Registration
We propose a new optimizer in the context of multimodal image registration. The optimized criterion is the mutual information between the images to align. This criterion requires ...
Michael Unser, Philippe Thévenaz