Sciweavers

10054 search results - page 2007 / 2011
» On the Complexity of Function Learning
Sort
View
IACR
2011
132views more  IACR 2011»
12 years 7 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...
CORR
2012
Springer
210views Education» more  CORR 2012»
12 years 3 months ago
Stability of the Max-Weight Protocol in Adversarial Wireless Networks
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...
Sungsu Lim, Kyomin Jung, Matthew Andrews
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 3 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
SIGMOD
2012
ACM
190views Database» more  SIGMOD 2012»
11 years 10 months ago
Sample-driven schema mapping
End-users increasingly find the need to perform light-weight, customized schema mapping. State-of-the-art tools provide powerful functions to generate schema mappings, but they u...
Li Qian, Michael J. Cafarella, H. V. Jagadish
MOBIHOC
2012
ACM
11 years 10 months ago
Serendipity: enabling remote computing among intermittently connected mobile devices
Mobile devices are increasingly being relied on for services that go beyond simple connectivity and require more complex processing. Fortunately, a mobile device encounters, possi...
Cong Shi, Vasileios Lakafosis, Mostafa H. Ammar, E...
« Prev « First page 2007 / 2011 Last » Next »