Sciweavers

1830 search results - page 101 / 366
» Workshop on Graph Computation Models
Sort
View
NJC
2006
88views more  NJC 2006»
15 years 4 months ago
Optimizing Slicing of Formal Specifications by Deductive Verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
Ingo Brückner, Björn Metzler, Heike Wehr...
ICCS
2010
Springer
15 years 2 months ago
Default Conceptual Graph Rules, Atomic Negation and Tic-Tac-Toe
Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show tha...
Jean-François Baget, Jérôme Fo...
DAIS
2011
14 years 8 months ago
Modeling the Performance of Ring Based DHTs in the Presence of Network Address Translators
Abstract. Dealing with Network Address Translators (NATs) is a central problem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay n...
John Ardelius, Boris Mejías
ACII
2005
Springer
15 years 6 months ago
The Bunch-Active Shape Model
Active Shape Model (ASM) is one of the most powerful statistical tools for face image alignment. In this paper, we propose a novel method, called Bunch-Active Shape Model (Bunch-AS...
Jingcai Fan, Hongxun Yao, Wen Gao, Yazhou Liu, Xin...
CONCUR
2000
Springer
15 years 8 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko