Sciweavers

136 search results - page 14 / 28
» Graph parameters and semigroup functions
Sort
View
CDC
2010
IEEE
172views Control Systems» more  CDC 2010»
12 years 11 months ago
Electrical centrality measures for electric power grid vulnerability analysis
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
Zhifang Wang, Anna Scaglione, Robert J. Thomas
FSTTCS
2010
Springer
13 years 5 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
ICML
2006
IEEE
14 years 8 months ago
Nonstationary kernel combination
The power and popularity of kernel methods stem in part from their ability to handle diverse forms of structured inputs, including vectors, graphs and strings. Recently, several m...
Darrin P. Lewis, Tony Jebara, William Stafford Nob...
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 7 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
CVPR
2003
IEEE
14 years 9 months ago
Object Segmentation Using Graph Cuts Based Active Contours
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation problems. Our method is a combination of active contours and the optimization t...
Ning Xu, Ravi Bansal, Narendra Ahuja