Sciweavers

1605 search results - page 202 / 321
» On Partitional Labelings of Graphs
Sort
View
132
Voted
JMIV
1998
93views more  JMIV 1998»
15 years 14 days ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra
PKDD
2010
Springer
235views Data Mining» more  PKDD 2010»
14 years 10 months ago
Online Structural Graph Clustering Using Frequent Subgraph Mining
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
Madeleine Seeland, Tobias Girschick, Fabian Buchwa...
99
Voted
ACCV
2006
Springer
15 years 6 months ago
Inducing Semantic Segmentation from an Example
Segmenting an image into semantically meaningful parts is a fundamental and challenging task in computer vision. Automatic methods are able to segment an image into coherent region...
Yaar Schnitman, Yaron Caspi, Daniel Cohen-Or, Dani...
99
Voted
ECCV
2010
Springer
15 years 6 months ago
Making Action Recognition Robust to Occlusions and Viewpoint Changes
Most state-of-the-art approaches to action recognition rely on global representations either by concatenating local information in a long descriptor vector or by computing a single...
EMNLP
2010
14 years 10 months ago
Clustering-Based Stratified Seed Sampling for Semi-Supervised Relation Classification
Seed sampling is critical in semi-supervised learning. This paper proposes a clusteringbased stratified seed sampling approach to semi-supervised learning. First, various clusteri...
Longhua Qian, Guodong Zhou