Sciweavers

52 search results - page 4 / 11
» May Testing, Non-interference, and Compositionality
Sort
View
ICWS
2008
IEEE
13 years 7 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
SEMWEB
2004
Springer
13 years 11 months ago
Information Gathering During Planning for Web Service Composition
Abstract. Hierarchical Task-Network (HTN) based planning techniques have been applied to the problem of composing Web Services, especially when described using the OWL-S service on...
Ugur Kuter, Evren Sirin, Dana S. Nau, Bijan Parsia...
BMCBI
2006
142views more  BMCBI 2006»
13 years 5 months ago
PedGenie: an analysis approach for genetic association testing in extended pedigrees and genealogies of arbitrary size
Background: We present a general approach to perform association analyses in pedigrees of arbitrary size and structure, which also allows for a mixture of pedigree members and ind...
Kristina Allen-Brady, Jathine Wong, Nicola J. Camp
CVPR
2009
IEEE
14 years 17 days ago
On compositional Image Alignment, with an application to Active Appearance Models
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositiona...
Brian Amberg, Andrew Blake, Thomas Vetter
ICIP
2002
IEEE
14 years 7 months ago
A method for color naming and description of color composition in images
Color is one of the main visual cues and has been frequently used in image processing, analysis and retrieval. The extraction of highlevel color descriptors is an increasingly imp...
Aleksandra Mojsilovic