1605 search results - page 155 / 321 » On Partitional Labelings of Graphs |
CAINE
2008
13 years 12 months ago
2008
This paper presents a novel method for learning from a labeled dataset to accurately classify unknown data. The recursive algorithm, termed Recursive Hyperspheric Classification, ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
SDM
2008
SIAM
13 years 11 months ago
2008
SIAM
Multi-label learning refers to the problems where an instance can be assigned to more than one category. In this paper, we present a novel Semi-supervised algorithm for Multi-labe...
TIP
2010
13 years 8 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
COMBINATORICA
2010
13 years 5 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...