1466 search results - page 121 / 294 » Complexity of Reasoning over Temporal Data Models |
138
click to vote
CSL
2010
Springer
15 years 4 months ago
2010
Springer
We present a system for model-based source separation for use on single channel speech mixtures where the precise source characteristics are not known a priori. The sources are mo...
129
click to vote
CPE
2000
Springer
15 years 8 months ago
2000
Springer
In this paper we present a tool for the simulation of fluid models of high-speed telecommunication networks. The aim of such a simulator is to evaluate measures which can not be ...
138
click to vote
CONCUR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
142
click to vote
CSL
2009
Springer
15 years 11 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
136
click to vote
KDD
1999
ACM
15 years 8 months ago
1999
ACM
In this paper a concern about the accuracy (as a function of parallelism) of a certain class of distributed learning algorithms is raised, and one proposed improvement is illustrat...