Sciweavers

1984 search results - page 20 / 397
» The colourful feasibility problem
Sort
View
ICSEA
2009
IEEE
13 years 7 months ago
Validation of Scenario-Based Business Requirements with Coloured Petri Nets
A scenario can be used to describe a possible instantiation of a given business use case and can be expressed for example as a list of steps written in natural language, or by an ...
Óscar R. Ribeiro, João M. Fernandes
WSC
1998
13 years 11 months ago
Properties of Synthetic Optimization Problems
In this paper, we present an approach for measuring certain properties of synthetic optimization problems based on the assumed distribution of coefficient values. We show how to e...
Charles H. Reilly
ECCV
1998
Springer
14 years 11 months ago
Estimating Coloured 3D Face Models from Single Images: An Example Based Approach
In this paper we present a method to derive 3D shape and surface texture of a human face from a single image. The method draws on a general flexible 3D face model which is "le...
Thomas Vetter, Volker Blanz
ACSC
2009
IEEE
14 years 1 months ago
Verification of the SIP Transaction Using Coloured Petri Nets
The Session Initiation Protocol (SIP) is one of the leading protocols for multimedia control over the Internet, including initiating, maintaining and terminating multimedia sessio...
Lin Liu
EMNLP
2010
13 years 7 months ago
Practical Linguistic Steganography Using Contextual Synonym Substitution and Vertex Colour Coding
Linguistic Steganography is concerned with hiding information in natural language text. One of the major transformations used in Linguistic Steganography is synonym substitution. ...
Ching-Yun Chang, Stephen Clark