103 search results - page 19 / 21 » Computational Interpretations of Classical Linear Logic |
95
Voted
ICML
2004
IEEE
15 years 3 months ago
2004
IEEE
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
117
click to vote
PODS
1994
ACM
15 years 2 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 {...
QEST
2005
IEEE
15 years 3 months ago
2005
IEEE
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
CAV
2007
Springer
15 years 4 months ago
2007
Springer
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
90
Voted
BMCBI
2005
14 years 10 months ago
2005
Computational Biology needs computer-readable information records. Increasingly, meta-analysed and pre-digested information is being used in the follow up of high throughput exper...