77 search results - page 5 / 16 » On expressiveness of the chain graph interpretations |
211
click to vote
TRIER
2002
15 years 6 months ago
2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
176
click to vote
ICCS
2000
Springer
15 years 10 months ago
2000
Springer
With the aim of building a "Semantic Web", the content of the documents must be explicitly represented through metadata in order to enable contents-guided search. Our app...
201
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
182
click to vote
CIE
2009
Springer
15 years 10 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
153
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
This paper presents an ontological analysis of the EPC (Eventdriven Process Chain) business process modeling notation supported in the ARIS Toolset. This ontological analysis prov...