Sciweavers

4245 search results - page 307 / 849
» Input Modeling
Sort
View
STACS
2005
Springer
16 years 20 days ago
Robust Polynomials and Quantum Algorithms
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
Harry Buhrman, Ilan Newman, Hein Röhrig, Rona...
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
16 years 18 days ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
WSC
1998
15 years 8 months ago
Simulation Optimization Research and Development
Simulation optimization is rapidly becoming a mainstream tool for simulation practitioners. Simulation optimization is the practice of linking an optimization method with a simula...
Royce Bowden, John D. Hall
CGF
2010
114views more  CGF 2010»
15 years 2 months ago
Transparent and Specular Object Reconstruction
This state of the art report covers reconstruction methods for transparent and specular objects or phenomena. While the 3D acquisition of opaque surfaces with lambertian reflectan...
Ivo Ihrke, Kiriakos N. Kutulakos, Hendrik P. A. Le...
ICIP
2004
IEEE
16 years 8 months ago
Data hiding in curves for collusion-resistant digital fingerprinting
* This paper presents a new data hiding method for curves. The proposed algorithm parameterizes a curve using the B-spline model and adds a spread spectrum sequence in the coordina...
Hongmei Gou, Min Wu