Sciweavers

895 search results - page 94 / 179
» Using graphs for some discrete tomography problems
Sort
View
IJWGS
2006
125views more  IJWGS 2006»
14 years 10 months ago
Compiling business processes: untangling unstructured loops in irreducible flow graphs
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
Wei Zhao, Rainer Hauser, Kamal Bhattacharya, Barre...
FOCS
2008
IEEE
14 years 11 months ago
Minimizing Movement in Mobile Facility Location Problems
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
Zachary Friggstad, Mohammad R. Salavatipour
CAV
2003
Springer
160views Hardware» more  CAV 2003»
15 years 3 months ago
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
Jan Obdrzálek
DMDW
2001
128views Management» more  DMDW 2001»
14 years 11 months ago
Improving Data Cleaning Quality Using a Data Lineage Facility
The problem of data cleaning, which consists of removing inconsistencies and errors from original data sets, is well known in the area of decision support systems and data warehou...
Helena Galhardas, Daniela Florescu, Dennis Shasha,...
MICCAI
2007
Springer
15 years 11 months ago
Non-rigid Image Registration Using Graph-cuts
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a p...
Tommy W. H. Tang, Albert C. S. Chung