10568 search results - page 1596 / 2114 » Computer Intelligence and Formalization |
197
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
190
click to vote
ADBIS
2009
Springer
16 years 1 months ago
2009
Springer
The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiting times f...
219
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
157
click to vote
CRYPTO
2009
Springer
16 years 1 months ago
2009
Springer
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
167
click to vote
EMSOFT
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...