Sciweavers

395 search results - page 38 / 79
» Polynomial Approximations for Model Checking
Sort
View
GLVLSI
2002
IEEE
118views VLSI» more  GLVLSI 2002»
15 years 2 months ago
Novel interconnect modeling by using high-order compact finite difference methods
— The high-order compact finite difference (HCFD) method is adapted for interconnect modeling. Based on the compact finite difference method, the HCFD method employs the Chebys...
Qinwei Xu, Pinaki Mazumder
WWW
2005
ACM
15 years 10 months ago
Automated semantic web services orchestration via concept covering
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
FLAIRS
2006
14 years 11 months ago
Sensitivity Analysis of Markovian Models
Sensitivity analysis of Markovian models amounts to computing the constants in polynomial functions of a parameter under study. To handle the computational complexity involved, we...
Theodore Charitos, Linda C. van der Gaag
ICPR
2008
IEEE
15 years 4 months ago
Graph cut based deformable model with statistical shape priors
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
Noha Youssry El-Zehiry, Adel Elmaghraby
WSC
2008
15 years 9 days ago
Smooth flexible models of nonhomogeneous poisson processes using one or more process realizations
We develop and evaluate a semiparametric method to estimate the mean-value function of a nonhomogeneous Poisson process (NHPP) using one or more process realizations observed over...
Michael E. Kuhl, Shalaka C. Deo, James R. Wilson