Sciweavers

1940 search results - page 219 / 388
» Graph Transformation with Variables
Sort
View
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 7 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen
MFCS
2010
Springer
15 years 5 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
COLOGNETWENTE
2010
15 years 3 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
IPMI
2001
Springer
16 years 7 months ago
Multi-scale 3-D Deformable Model Segmentation Based on Medial Description
This paper presents a Bayesian multi-scale three dimensional deformable template approach based on a medial representation for the segmentation and shape characterization of anatom...
Sarang C. Joshi, Stephen M. Pizer, P. Thomas Fletc...
IWMM
2007
Springer
85views Hardware» more  IWMM 2007»
16 years 1 months ago
Uniqueness inference for compile-time object deallocation
This paper presents an analysis and transformation for individual object reclamation in Java programs. First, we propose a uniqueness inference algorithm that identifies variable...
Sigmund Cherem, Radu Rugina