Sciweavers

478 search results - page 57 / 96
» Measuring the Similarity of Labeled Graphs
Sort
View
KDD
2008
ACM
257views Data Mining» more  KDD 2008»
15 years 10 months ago
Knowledge discovery of semantic relationships between words using nonparametric bayesian graph model
We developed a model based on nonparametric Bayesian modeling for automatic discovery of semantic relationships between words taken from a corpus. It is aimed at discovering seman...
Issei Sato, Minoru Yoshida, Hiroshi Nakagawa
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 4 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Polynomial Deterministic Rendezvous in Arbitrary Graphs
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
Dariusz R. Kowalski, Andrzej Pelc
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
15 years 10 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
BMCV
2000
Springer
15 years 2 months ago
Pose-Independent Object Representation by 2-D Views
We here describe a view-based system for the pose-independent representation of objects without making reference to 3-D models. Input to the system is a collection of pictures cov...
Jan Wieghardt, Christoph von der Malsburg