Sciweavers

697 search results - page 19 / 140
» A Study of Evaluation Functions for the Graph K-Coloring Pro...
Sort
View
CVPR
2010
IEEE
13 years 10 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
14 years 8 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert
ICASSP
2008
IEEE
14 years 2 months ago
Probabilistic framework for gene expression clustering validation based on gene ontology and graph theory
Based on the correlation between expression and ontologydriven gene similarity, we incorporate functional annotations into gene expression clustering validation. A probabilistic f...
Yinyin Yuan, Chang-Tsun Li
TSE
2011
111views more  TSE 2011»
13 years 2 months ago
Software Module Clustering as a Multi-Objective Search Problem
Software module clustering is the problem of automatically organising software units into modules to improve program structure. There has been a great deal of recent interest in s...
Kata Praditwong, Mark Harman, Xin Yao
JMLR
2010
159views more  JMLR 2010»
13 years 2 months ago
Semi-Supervised Learning with Max-Margin Graph Cuts
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...
Branislav Kveton, Michal Valko, Ali Rahimi, Ling H...