Sciweavers

1172 search results - page 30 / 235
» Path Algorithms on Regular Graphs
Sort
View
TIP
2010
155views more  TIP 2010»
13 years 6 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—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 ...
Xiaofei He
DAM
2010
60views more  DAM 2010»
13 years 7 months ago
One-to-many node-disjoint paths in (n, k)-star graphs
We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n - 1 node-di...
Yonghong Xiang, Iain A. Stewart
ICDCIT
2005
Springer
14 years 1 months ago
Cleaning an Arbitrary Regular Network with Mobile Agents
In this paper, we consider a contaminated network with an intruder. The task for the mobile agents is to decontaminate all hosts while preventing a recontamination and to do so as ...
Paola Flocchini, Amiya Nayak, Arno Schulz
ICIP
2007
IEEE
14 years 2 months ago
Classification by Cheeger Constant Regularization
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...
Hsun-Hsien Chang, José M. F. Moura
ICASSP
2011
IEEE
12 years 11 months ago
Multi-graph regularization for efficient delivery of user generated content in online social networks
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
Jacob Chakareski