Sciweavers

649 search results - page 54 / 130
» A Graph Pebbling Algorithm on Weighted Graphs
Sort
View
ICML
2006
IEEE
14 years 9 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
ICIP
2008
IEEE
14 years 3 months ago
Multi-polarity text segmentation using graph theory
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
Jia Li, YongHong Tian, Tiejun Huang, Wen Gao
SIAMCOMP
2010
125views more  SIAMCOMP 2010»
13 years 3 months ago
Approximating Steiner Networks with Node-Weights
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
Zeev Nutov
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
ICAPR
2005
Springer
14 years 2 months ago
Weighted Adaptive Neighborhood Hypergraph Partitioning for Image Segmentation
Abstract. The aim of this paper is to present an improvement of a previously published algorithm. The proposed approach is performed in two steps. In the first step, we generate t...
Soufiane Rital, Hocine Cherifi, Serge Miguet