Sciweavers

235 search results - page 41 / 47
» Quantum certificate complexity
Sort
View
COMPSAC
2002
IEEE
14 years 19 days ago
The Quest for Software Components Quality
Component based software development is becoming more generalized, representing a considerable market for the software industry. The perspective of reduced development costs and s...
Miguel Goulão, Fernando Brito e Abreu
COCOON
2006
Springer
13 years 11 months ago
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
Min Chih Lin, Jayme Luiz Szwarcfiter
SAC
2006
ACM
13 years 7 months ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
IHI
2010
109views Healthcare» more  IHI 2010»
13 years 2 months ago
Process-based derivation of requirements for medical devices
One goal of medical device certification is to show that a given medical device satisfies its requirements. The requirements that should be met by a device, however, depend on the...
Heather M. Conboy, George S. Avrunin, Lori A. Clar...
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
13 years 9 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek