2304 search results - page 178 / 461 » On the Vulnerability of Large Graphs |
198
click to vote
NIPS
2004
15 years 8 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
216
click to vote
CVPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In this work, video segmentation is viewed as an efficient intra-frame grouping temporally reinforced by a strong inter-frame coherence. Traditional approaches simply regard pixel...
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
163
click to vote
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
Coping with Information Overload is a major challenge of the 21st century. Huge volumes and varieties of multilingual data must be processed to extract salient information. Previo...
192
click to vote
ACL
2010
15 years 4 months ago
2010
Graph-based semi-supervised learning (SSL) algorithms have been successfully used to extract class-instance pairs from large unstructured and structured text collections. However,...