Sciweavers

746 search results - page 64 / 150
» Fast (Structured) Newton Computations
Sort
View
DAGM
2010
Springer
13 years 11 months ago
3D Object Detection Using a Fast Voxel-Wise Local Spherical Fourier Tensor Transformation
In this paper we present a novel approach for expanding spherical 3D-tensor fields of arbitrary order in terms of a tensor valued local Fourier basis. For an efficient implementati...
Henrik Skibbe, Marco Reisert, Thorsten Schmidt, Kl...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 10 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye
CORR
2002
Springer
104views Education» more  CORR 2002»
13 years 10 months ago
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
Michael A. Soss, Jeff Erickson, Mark H. Overmars
GMP
2010
IEEE
214views Solid Modeling» more  GMP 2010»
14 years 2 months ago
Efficient Computation of 3D Clipped Voronoi Diagram
The Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D d...
Dong-Ming Yan, Wenping Wang, Bruno Lévy, Ya...
SIGCSE
1999
ACM
193views Education» more  SIGCSE 1999»
14 years 2 months ago
Cache conscious programming in undergraduate computer science
The wide-spread use of microprocessor based systems that utilize cache memory to alleviate excessively long DRAM access times introduces a new dimension in the quest to obtain goo...
Alvin R. Lebeck