Sciweavers

6110 search results - page 1083 / 1222
» Approximate Computing
Sort
View
FOCS
2007
IEEE
16 years 19 days ago
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
Parikshit Gopalan, Subhash Khot, Rishi Saket
STACS
2007
Springer
16 years 12 days ago
Wavelength Management in WDM Rings to Maximize the Number of Connections
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
Ioannis Caragiannis
GRAPHITE
2006
ACM
16 years 8 days ago
Two-stage compression for fast volume rendering of time-varying scalar data
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
Daisuke Nagayasu, Fumihiko Ino, Kenichi Hagihara
VISUALIZATION
2005
IEEE
15 years 12 months ago
Illuminated Lines Revisited
For the rendering of vector and tensor fields, several texturebased volumetric rendering methods were presented in recent years. While they have indisputable merits, the classica...
Ovidio Mallo, Ronald Peikert, Christian Sigg, Fili...
GRAPHITE
2005
ACM
15 years 12 months ago
3D screen-space widgets for non-linear projection
Linear perspective is a good approximation to the format in which the human visual system conveys 3D scene information to the brain. Artists expressing 3D scenes, however, create ...
Patrick Coleman, Karan Singh, Leon Barrett, Nisha ...
« Prev « First page 1083 / 1222 Last » Next »