Sciweavers

2137 search results - page 330 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ICCV
2009
IEEE
15 years 1 months ago
GroupSAC: Efficient Consensus in the Presence of Groupings
We present a novel variant of the RANSAC algorithm that is much more efficient, in particular when dealing with problems with low inlier ratios. Our algorithm assumes that there...
Kai Ni, Hailin Jin, Frank Dellaert
SAC
2010
ACM
14 years 2 months ago
User-controlled generalization boundaries for p-sensitive k-anonymity
Numerous privacy models based on the k-anonymity property have been introduced in the last few years. While differing in their methods and quality of their results, they all focus...
Alina Campan, Traian Marius Truta, Nicholas Cooper
SRDS
1998
IEEE
14 years 1 months ago
Interactive Image Retrieval over the Internet
In the paper, an e cient image database system is developed. The most important features of the proposed system include compressed domain indexing, searching by using scalable fea...
Jozsef Vass, Jia Yao, Anupam Joshi, Kannappan Pala...
KDD
1997
ACM
146views Data Mining» more  KDD 1997»
14 years 1 months ago
Density-Connected Sets and their Application for Trend Detection in Spatial Databases
1 Several clustering algorithms have been proposed for class identification in spatial databases such as earth observation databases. The effectivity of the well-known algorithms ...
Martin Ester, Hans-Peter Kriegel, Jörg Sander...
PDCN
2007
13 years 10 months ago
One-to-all personalized communication in torus networks
Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each ...
Weizhen Mao, Jie Chen, William A. Watson III