Sciweavers

16257 search results - page 2997 / 3252
» D-finiteness: algorithms and applications
Sort
View
FPGA
2000
ACM
141views FPGA» more  FPGA 2000»
15 years 10 months ago
Tolerating operational faults in cluster-based FPGAs
In recent years the application space of reconfigurable devices has grown to include many platforms with a strong need for fault tolerance. While these systems frequently contain ...
Vijay Lakamraju, Russell Tessier
RT
2000
Springer
15 years 10 months ago
Fast Global Illumination Including Specular Effects
Rapidly simulating global illumination, including diffuse and glossy light transport is a very difficult problem. Finite element or radiosity approaches can achieve interactive si...
Xavier Granier, George Drettakis, Bruce Walter
ICCV
1995
IEEE
15 years 10 months ago
Bayesian Decision Theory, the Maximum Local Mass Estimate, and Color Constancy
Computational vision algorithms are often developed in a Bayesian framework. Two estimators are commonly used: maximum a posteriori (MAP), and minimum mean squared error (MMSE). W...
William T. Freeman, David H. Brainard
SIGGRAPH
1995
ACM
15 years 10 months ago
Automatic reconstruction of surfaces and scalar fields from 3D scans
We present an efficient and uniform approach for the automatic reconstruction of surfaces of CAD (computer aided design) models and scalar fields defined on them, from an unorg...
Chandrajit L. Bajaj, Fausto Bernardini, Guoliang X...
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
15 years 10 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
« Prev « First page 2997 / 3252 Last » Next »