Sciweavers

3268 search results - page 261 / 654
» The hub number of a graph
Sort
View
SOICT
2010
15 years 1 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
CORR
2011
Springer
139views Education» more  CORR 2011»
14 years 10 months ago
Clustering Partially Observed Graphs via Convex Optimization
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
Ali Jalali, Yudong Chen, Sujay Sanghavi, Huan Xu
ICDM
2008
IEEE
107views Data Mining» more  ICDM 2008»
16 years 1 months ago
Graph-Based Iterative Hybrid Feature Selection
When the number of labeled examples is limited, traditional supervised feature selection techniques often fail due to sample selection bias or unrepresentative sample problem. To ...
ErHeng Zhong, Sihong Xie, Wei Fan, Jiangtao Ren, J...
EMMCVPR
2007
Springer
16 years 25 days ago
Simulating Classic Mosaics with Graph Cuts
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
Yu Liu, Olga Veksler, Olivier Juan
IPPS
1998
IEEE
15 years 11 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad