Sciweavers

2034 search results - page 197 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 3 months ago
Mixed-Membership Stochastic Block-Models for Transactional Networks
Abstract: Transactional network data can be thought of as a list of oneto-many communications (e.g., email) between nodes in a social network. Most social network models convert th...
Mahdi Shafiei, Hugh Chipman
DAS
2004
Springer
14 years 1 months ago
Adaptive Region Growing Color Segmentation for Text Using Irregular Pyramid
This paper presents the result of an adaptive region growing segmentation technique for color document images using an irregular pyramid structure. The emphasis is in the segmentat...
Poh Kok Loo, Chew Lim Tan
DICTA
2003
13 years 9 months ago
Fast Adaptive Algorithm for Time-Critical Color Quantization Application
Color quantization is the process of grouping n data points to k cluster. We proposed a new approach, based on Wu’s color quantization [6]. Our approach can significantly reduce ...
Kiattisin Kanjanawanishkul, Bunyarit Uyyanonvara
ICPR
2008
IEEE
14 years 9 months ago
Unsupervised image embedding using nonparametric statistics
Embedding images into a low dimensional space has a wide range of applications: visualization, clustering, and pre-processing for supervised learning. Traditional dimension reduct...
Guobiao Mei, Christian R. Shelton
PAMI
2012
11 years 10 months ago
BRIEF: Computing a Local Binary Descriptor Very Fast
Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach...
Michael Calonder, Vincent Lepetit, Mustafa Öz...