Sciweavers

44 search results - page 8 / 9
» Probe Ptolemaic Graphs
Sort
View
CVPR
2007
IEEE
14 years 7 months ago
Optimizing Binary MRFs via Extended Roof Duality
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
Carsten Rother, Vladimir Kolmogorov, Victor S. Lem...
COMPLEX
2009
Springer
13 years 11 months ago
Comparing Networks from a Data Analysis Perspective
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
Wei Li, Jing-Yu Yang
IEEECIT
2007
IEEE
13 years 11 months ago
Overview of LDPC Codes
In light of the history of LDPC codes and relevant research advances in recent years, this paper probes into the encoding and decoding techniques related to this capacity-approach...
Zongjie Tu, Shiyong Zhang
SOFTVIS
2005
ACM
13 years 10 months ago
Exploiting UML dynamic object modeling for the visualization of C++ programs
In this paper we present an approach to modeling and visualizing the dynamic interactions among objects in a C++ application. We exploit UML diagrams to expressively visualize bot...
Brian A. Malloy, James F. Power
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
13 years 10 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao