376 search results - page 54 / 76 » Developing Theories of Types and Computability via Realizabi... |
ENTCS
2008
13 years 7 months ago
2008
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope w...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
TEI
2010
ACM
14 years 2 months ago
2010
ACM
Advances in the creation of computational materials are transforming our thinking about relations between the physical and digital. In this paper we characterize this transformati...
PODS
1994
ACM
13 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...