Sciweavers

1023 search results - page 149 / 205
» A Formal Method for Program Slicing
Sort
View
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
15 years 7 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
FMCAD
2004
Springer
15 years 7 months ago
Approximate Symbolic Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
Tobias Nopper, Christoph Scholl
GCC
2003
Springer
15 years 6 months ago
Toward the Composition of Semantic Web Services
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
Jinghai Rao, Xiaomeng Su
ECAI
2000
Springer
15 years 5 months ago
A Knowledge-based Approach for Lifelike Gesture Animation
Abstract. The inclusion of additional modalities into the communicative behavior of virtual agents besides speech has moved into focus of human-computer interface researchers, as h...
Stefan Kopp, Ipke Wachsmuth
EMNLP
2008
15 years 3 months ago
Sparse Multi-Scale Grammars for Discriminative Latent Variable Parsing
We present a discriminative, latent variable approach to syntactic parsing in which rules exist at multiple scales of refinement. The model is formally a latent variable CRF gramm...
Slav Petrov, Dan Klein