2612 search results - page 404 / 523 » Switching Graphs and Their Complexity |
ICMCS
2007
IEEE
15 years 4 months ago
2007
IEEE
Image segmentation has been studied for many years. But what factors influence segmentation results indeed? Why some images are easy to be handled while the others are not? In thi...
ICCSA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
ISSRE
2006
IEEE
15 years 4 months ago
2006
IEEE
BPEL is a language that could express complex concurrent behaviors. This paper presents a novel method of BPEL test case generation, which is based on concurrent path analysis. Th...
116
click to vote
ISPDC
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
VL
2005
IEEE
15 years 3 months ago
2005
IEEE
Executable UML models are nowadays gaining interest in embedded systems design. This domain is strongly devoted to the modeling of reactive behavior using StateChart variants. In ...