Sciweavers

1390 search results - page 140 / 278
» On the Algebraic Structure of Convergence
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Element Rearrangement for Tensor-Based Subspace Learning
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
Shuicheng Yan, Dong Xu, Stephen Lin, Thomas S. Hua...
ETVC
2008
15 years 8 months ago
Intrinsic Geometries in Learning
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...
Richard Nock, Frank Nielsen
JUCS
2010
150views more  JUCS 2010»
15 years 5 months ago
SOM Clustering to Promote Interoperability of Directory Metadata: A Grid-Enabled Genetic Algorithm Approach
: Directories provide a general mechanism for describing resources and enabling information sharing within and across organizations. Directories must resolve differing structures a...
Lei Li, Vijay K. Vaishnavi, Art Vandenberg
DAC
2010
ACM
15 years 4 months ago
A robust periodic arnoldi shooting algorithm for efficient analysis of large-scale RF/MM ICs
The verification of large radio-frequency/millimeter-wave (RF/MM) integrated circuits (ICs) has regained attention for high-performance designs beyond 90nm and 60GHz. The traditio...
Xuexin Liu, Hao Yu, Sheldon X.-D. Tan
TSP
2010
15 years 1 months ago
Efficient Maximum Entropy Reconstruction of Nuclear Magnetic Resonance T1-T2 Spectra
Abstract--This paper deals with the reconstruction of T1-T2 correlation spectra in nuclear magnetic resonance relaxometry. The ill-posed character and the large size of this invers...
Emilie Chouzenoux, Saïd Moussaoui, Jér...