308 search results - page 25 / 62 » Making Abstract Domains Condensing |
OTM
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Although cryptographic implementation tasks are often undertaken by expert programmers, a plethora of performance and security driven options, as well as more mundane sof...
SARA
2007
Springer
15 years 4 months ago
2007
Springer
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
DASFAA
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract. In this paper, we present a FASST mining approach to extract the frequently changing semantic structures (FASSTs), which are a subset of semantic substructures that chang...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The vision of a Semantic Web has recently drawn considerable attention, both from academia and industry. Description logics are often named as one of the tools that can s...
GBRPR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. An appropriate image representation induces some good image treatment algorithms. Hypergraph theory is a theory of finite combinatorial sets, modeling a lot of problems ...