6274 search results - page 635 / 1255 » Proofs, Programs, Processes |
251
click to vote
GOSLER
1995
15 years 10 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
183
click to vote
AAAI
2008
15 years 9 months ago
2008
The interpreted system model offers a computationally grounded model, in terms of the states of computer processes, to S5 epistemic logics. This paper extends the interpreted syst...
188
click to vote
CCS
2008
ACM
15 years 9 months ago
2008
ACM
A practically feasible modification to fixed-priority schedulers allows to avoid timing channels despite threads having access to precise clocks. This modification is rather simpl...
174
click to vote
NIPS
2007
15 years 8 months ago
2007
Brain-Computer Interfaces can suffer from a large variance of the subject conditions within and across sessions. For example vigilance fluctuations in the individual, variable ta...
221
click to vote
SEDE
2007
2007
A framework for constraint checking involving aggregates for multiple XML databases using schematron
15 years 8 months ago
Many internet and enterprise applications now not only use XML (eXtensible Markup Language) as a medium for communication but also for storing their data either temporarily for an...