Sciweavers

3172 search results - page 345 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
CG
2011
Springer
15 years 1 months ago
Multiresolutions numerically from subdivisions
In previous work we introduced a construction to produce multiresolutions from given subdivisions. A portion of that construction required solving bilinear equations using a symbo...
Richard H. Bartels, Faramarz Samavati
COR
2011
15 years 1 months ago
Size-reduction heuristics for the unrelated parallel machines scheduling problem
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job diļ¬...
Luis Fanjul-Peyro, Rubén Ruiz
CORR
2011
Springer
172views Education» more  CORR 2011»
15 years 1 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
CORR
2011
Springer
142views Education» more  CORR 2011»
15 years 1 months ago
A Logical Method for Policy Enforcement over Evolving Audit Logs
We present an iterative algorithm for enforcing policies represented in a first-order logic, which can, in particular, express all transmission-related clauses in the HIPAA Priva...
Deepak Garg, Limin Jia, Anupam Datta
181
Voted
CORR
2011
Springer
167views Education» more  CORR 2011»
15 years 1 months ago
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
We propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented ...
Carolin Lunemann, Jesper Buus Nielsen