2629 search results - page 244 / 526 » complex 2009 |
184
click to vote
MDM
2009
Springer
16 years 22 days ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
170
click to vote
PDCAT
2009
Springer
16 years 22 days ago
2009
Springer
—In the crash-recovery failure model of asynchronous distributed systems, processes can temporarily stop to execute steps and later restart their computation from a predefined l...
184
click to vote
SACRYPT
2009
Springer
16 years 22 days ago
2009
Springer
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
139
click to vote
SAFECOMP
2009
Springer
16 years 22 days ago
2009
Springer
The behaviour of control functions in safety critical software systems is typically bounded to prevent the occurrence of known system level hazards. These bounds are typically deri...
186
click to vote
SAT
2009
Springer
16 years 22 days ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...