Sciweavers

2168 search results - page 414 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
TMC
2011
261views more  TMC 2011»
14 years 6 months ago
Breath: An Adaptive Protocol for Industrial Control Applications Using Wireless Sensor Networks
—An energy-efficient, reliable and timely data transmission is essential for wireless sensor networks (WSNs) employed in scenarios where plant information must be available for ...
Pan Gun Park, Carlo Fischione, Alvise Bonivento, K...
WWW
2011
ACM
14 years 6 months ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg
CGF
2011
14 years 3 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
IACR
2011
132views more  IACR 2011»
13 years 11 months ago
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
Sebastian Faust, Krzysztof Pietrzak, Daniele Ventu...
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
15 years 12 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...