Sciweavers

1391 search results - page 215 / 279
» Complexity Limitations on Quantum Computation
Sort
View
TOG
2008
125views more  TOG 2008»
13 years 8 months ago
Progressive photon mapping
This paper introduces a simple and robust progressive global illumination algorithm based on photon mapping. Progressive photon mapping is a multi-pass algorithm where the first p...
Toshiya Hachisuka, Shinji Ogaki, Henrik Wann Jense...
AROBOTS
1999
140views more  AROBOTS 1999»
13 years 8 months ago
A Robust Analog VLSI Motion Sensor Based on the Visual System of the Fly
Sensing visual motion gives a creature valuable information about its interactions with the environment. Flies in particular use visual motion information to navigate through turbu...
Reid R. Harrison, Christof Koch
MAM
2002
128views more  MAM 2002»
13 years 7 months ago
Component-based development of DSP software for mobile communication terminals
DSP software development has been tied down by extreme computational requirements. Furthermore, the DSP development tools available today are less advanced than in other embedded ...
Kari Jyrkkä, Olli Silvén, Olli Ali-Yrk...
PC
2002
137views Management» more  PC 2002»
13 years 7 months ago
The Chebyshev iteration revisited
Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massiv...
Martin H. Gutknecht, Stefan Röllin
RSA
2010
89views more  RSA 2010»
13 years 6 months ago
Some remarks on Betti numbers of random polygon spaces
Polygon spaces like Mℓ = {(u1, · · · , un) ∈ S1 × · · · S1 ; n i=1 liui = 0}/SO(2) or they three dimensional analogues Nℓ play an important rle in geometry and topolo...
Clément Dombry, Christian Mazza