Sciweavers

828 search results - page 56 / 166
» Bounded Hairpin Completion
Sort
View
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
13 years 8 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
WAOA
2010
Springer
246views Algorithms» more  WAOA 2010»
13 years 8 months ago
Tradeoff between Energy and Throughput for Online Deadline Scheduling
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
Ho-Leung Chan, Tak Wah Lam, Rongbin Li
CORR
2011
Springer
178views Education» more  CORR 2011»
13 years 1 months ago
Online Learning: Stochastic and Constrained Adversaries
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
PODS
2012
ACM
253views Database» more  PODS 2012»
12 years 18 days ago
Local transformations and conjunctive-query equivalence
Over the past several decades, the study of conjunctive queries has occupied a central place in the theory and practice of database systems. In recent years, conjunctive queries h...
Ronald Fagin, Phokion G. Kolaitis
FOCS
2009
IEEE
14 years 4 months ago
Smoothed Analysis of Multiobjective Optimization
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
Heiko Röglin, Shang-Hua Teng