1466 search results - page 73 / 294 » Complexity of Reasoning over Temporal Data Models |
138
click to vote
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
129
click to vote
SIGSOFT
2010
ACM
15 years 1 months ago
2010
ACM
Concurrent program verification is challenging because it involves exploring a large number of possible thread interleavings together with complex sequential reasoning. As a resul...
158
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper, we consider the problem of super-resolving a human face video by a very high (?16) zoom factor. Inspired by recent literature on hallucination and examplebased lear...
163
click to vote
JMLR
2010
14 years 11 months ago
2010
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
154
Voted
TOPNOC
2008
15 years 4 months ago
2008
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...