Sciweavers

2304 search results - page 204 / 461
» On the Vulnerability of Large Graphs
Sort
View
CIKM
2009
Springer
16 years 1 months ago
Improving web page classification by label-propagation over click graphs
In this paper, we present a semi-supervised learning method for web page classification, leveraging click logs to augment training data by propagating class labels to unlabeled si...
Soo-Min Kim, Patrick Pantel, Lei Duan, Scott Gaffn...
ASIAMS
2007
IEEE
16 years 28 days ago
Broadcasting in (n, k)-Arrangement Graph Based on an Optimal Spanning Tree
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
Jingli Li, Yonghong Xiang, Manli Chen, Yongheng Zh...
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
16 years 19 days ago
Spectral Sequencing Based on Graph Distance
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...
Rong Liu, Hao Zhang 0002, Oliver van Kaick
ECCV
2010
Springer
15 years 12 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
RTAS
1998
IEEE
15 years 10 months ago
Managing Memory Requirements in the Synthesis of Real-Time Systems from Processing Graphs
In the past, environmental restrictions on size, weight, and power consumption have severely limited both the processing and storage capacity of embedded signal processing systems...
Steve Goddard, Kevin Jeffay