Sciweavers

24 search results - page 3 / 5
» A characterization of uniquely vertex colorable graphs using...
Sort
View
BMCBI
2004
117views more  BMCBI 2004»
13 years 6 months ago
Cancer characterization and feature set extraction by discriminative margin clustering
Background: A central challenge in the molecular diagnosis and treatment of cancer is to define a set of molecular features that, taken together, distinguish a given cancer, or ty...
Kamesh Munagala, Robert Tibshirani, Patrick O. Bro...
CVPR
2008
IEEE
14 years 8 months ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 25 days ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
DAM
2010
137views more  DAM 2010»
13 years 6 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 6 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani