4666 search results - page 214 / 934 » Equations on Timed Languages |
278
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
286
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
157
click to vote
IJCNLP
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. Temporal question classification assigns time granularities to temporal questions ac-cording to their anticipated answers. It is very important for answer extraction and ...
202
click to vote
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
Rectangular hybrid automatamodel digital control programs of analog plant environments. We study rectangular hybrid automatawhere the plant state evolves continuously in real-numbe...
192
click to vote
ERCIMDL
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Recent work on analyzing query logs shows that a significant fraction of queries are temporal, i.e., relevancy is dependent on time, and temporal queries play an importan...