5055 search results - page 251 / 1011 » Relative Timing |
193
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
169
click to vote
CAV
2005
Springer
16 years 11 days ago
2005
Springer
We consider in the current paper the issue of exploiting the structural form of Esterel programs [BG92] to partition the algorithmic RSS (reachable state space) fix-point construc...
159
click to vote
NIME
2004
Springer
16 years 5 days ago
2004
Springer
When envisaging new digital instruments, designers do not have to limit themselves to their sonic capabilities (which can be absolutely any), not even to their algorithmic power; ...
175
click to vote
ACMSE
2010
ACM
15 years 4 months ago
2010
ACM
Many research studies adopt manually selected patterns for semantic relation extraction. However, manually identifying and discovering patterns is time consuming and it is difficu...
174
click to vote
LREC
2008
15 years 8 months ago
2008
Recent years have seen increasing attention in temporal processing of texts as well as a lot of standardization effort of temporal information in natural language. A central part ...