Sciweavers

1089 search results - page 144 / 218
» Bounds on generalized Frobenius numbers
Sort
View
MOBIHOC
2008
ACM
14 years 8 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
EDBTW
2010
Springer
14 years 3 months ago
Updating probabilistic XML
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
Evgeny Kharlamov, Werner Nutt, Pierre Senellart
CP
2007
Springer
14 years 3 months ago
GAC Via Unit Propagation
In this paper we argue that an attractive and potentially very general way of achieving generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a C...
Fahiem Bacchus
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 3 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
EUROPKI
2007
Springer
14 years 3 months ago
On Partial Anonymity in Secret Sharing
Abstract. Anonymous secret sharing schemes allow a secret to be recovered from shares regardless of the identity of shareholders. Besides being interesting in its own right, this p...
Vanesa Daza, Josep Domingo-Ferrer