Sciweavers

1539 search results - page 127 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
127
Voted
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
16 years 2 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
102
Voted
SCALESPACE
2005
Springer
15 years 8 months ago
Texture Mapping via Spherical Multi-dimensional Scaling
Abstract. We present a technique for texture mapping arbitrary sphere-like surfaces with minimal distortions by spherical embedding. The embedding is computed using spherical multi...
Asi Elad (Elbaz), Yosi Keller, Ron Kimmel
149
Voted
CVPR
2004
IEEE
16 years 4 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma
ECCV
2008
Springer
16 years 4 months ago
Belief Propagation with Directional Statistics for Solving the Shape-from-Shading Problem
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
Tom S. F. Haines, Richard C. Wilson
RT
1999
Springer
15 years 6 months ago
Interactive Rendering with Arbitrary BRDFs using Separable Approximations
A separable decomposition of bidirectional reflectance distributions (BRDFs) is used to implement arbitrary reflectances from point sources on existing graphics hardware. Two-dim...
Jan Kautz, Michael D. McCool