Sciweavers

2137 search results - page 160 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
CLEF
2011
Springer
13 years 10 months ago
A Language-Independent Approach to Identify the Named Entities in Under-Resourced Languages and Clustering Multilingual Document
Abstract. This paper presents a language-independent Multilingual Document Clustering (MDC) approach on comparable corpora. Named entites (NEs) such as persons, locations, organiza...
N. Kiran Kumar, G. S. K. Santosh, Vasudeva Varma
80
Voted
MVA
1998
230views Computer Vision» more  MVA 1998»
14 years 11 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
90
Voted
ICIP
2008
IEEE
15 years 12 months ago
Variational Bayesian image processing on stochastic factor graphs
In this paper, we present a patch-based variational Bayesian framework of image processing using the language of factor graphs (FGs). The variable and factor nodes of FGs represen...
Xin Li
78
Voted
WWW
2004
ACM
15 years 11 months ago
Graph-based text database for knowledge discovery
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
Junji Tomita, Hidekazu Nakawatase, Megumi Ishii
90
Voted
IJON
2006
127views more  IJON 2006»
14 years 10 months ago
Sparse ICA via cluster-wise PCA
In this paper, it is shown that Independent Component Analysis (ICA) of sparse signals (sparse ICA) can be seen as a cluster-wise Principal Component Analysis (PCA). Consequently,...
Massoud Babaie-Zadeh, Christian Jutten, Ali Mansou...