492 search results - page 83 / 99 » Simplifying Probabilistic Programs Using Computer Algebra |
SQJ
2002
14 years 10 months ago
2002
Acknowledging the intense requirement for low power operation in most portable computing systems, this paper introduces the notion of energy efficient software design and proposes ...
ICALP
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
ICALP
1990
Springer
15 years 2 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
ESOP
2008
Springer
15 years 9 days ago
2008
Springer
In an optimistic approach to security, one can often simplify protocol design by relying on audit logs, which can be analyzed a posteriori. Such auditing is widely used in practice...
WOTUG
2008
14 years 12 months ago
2008
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...