Sciweavers

1552 search results - page 308 / 311
» On the Complexity of Constant Propagation
Sort
View
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
13 years 5 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
BMCBI
2011
13 years 2 months ago
nocoRNAc: Characterization of non-coding RNAs in prokaryotes
Background: The interest in non-coding RNAs (ncRNAs) constantly rose during the past few years because of the wide spectrum of biological processes in which they are involved. Thi...
Alexander Herbig, Kay Nieselt
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
On Quadratic Programming with a Ratio Objective
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
Aditya Bhaskara, Moses Charikar, Rajsekar Manokara...
CEC
2010
IEEE
13 years 2 months ago
Parameter estimation with term-wise decomposition in biochemical network GMA models by hybrid regularized Least Squares-Particle
High-throughput analytical techniques such as nuclear magnetic resonance, protein kinase phosphorylation, and mass spectroscopic methods generate time dense profiles of metabolites...
Prospero C. Naval, Luis G. Sison, Eduardo R. Mendo...
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...