Sciweavers

522 search results - page 15 / 105
» Energy Models for Graph Clustering
Sort
View
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
15 years 5 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
15 years 6 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
VL
2005
IEEE
107views Visual Languages» more  VL 2005»
15 years 5 months ago
Navigating Software Architectures with Constant Visual Complexity
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
Wanchun Li, Peter Eades, Seok-Hee Hong
DAGM
2006
Springer
15 years 3 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz
ICPR
2010
IEEE
15 years 5 months ago
Live Cell Segmentation in Fluorescence Microscopy via Graph Cut
We propose a novel Markovian segmentation model which takes into account edge information. By construction, the model uses only pairwise interactions and its energy is submodula...
Milán Leskó, Zoltan Kato, Antal Nagy, Imre Gombo...