Sciweavers

12825 search results - page 1873 / 2565
» Improved PLSOM algorithm
Sort
View
CSDA
2006
94views more  CSDA 2006»
15 years 7 months ago
Simulation-based approach to estimation of latent variable models
We propose a simulation-based method for calculating maximum likelihood estimators in latent variable models. The proposed method integrates a recently developed sampling strategy...
Zhiguang Qian, Alexander Shapiro
CVIU
2006
214views more  CVIU 2006»
15 years 7 months ago
A survey of approaches and challenges in 3D and multi-modal 3D + 2D face recognition
This survey focuses on recognition performed by matching models of the three-dimensional shape of the face, either alone or in combination with matching corresponding two-dimensio...
Kevin W. Bowyer, Kyong I. Chang, Patrick J. Flynn
IJISTA
2008
87views more  IJISTA 2008»
15 years 7 months ago
On fusion of range and intensity information using Graph-Cut for planar patch segmentation
: Planar patch detection aims at simplifying data from 3-D imaging sensors to a more compact scene description. We propose a fusion of intensity and depth information using Graph-C...
Olaf Kähler, Erik Rodner, Joachim Denzler
JCP
2008
178views more  JCP 2008»
15 years 7 months ago
Building Design Optimization Using Sequential Linear Programming
-In this paper a nonlinear programming approach is used for the minimization of total communication cost to determine the optimum room dimensions for each room. The nonlinear progr...
Rekha Bhowmik
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 7 months ago
Faster subsequence recognition in compressed strings
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
Alexandre Tiskin
« Prev « First page 1873 / 2565 Last » Next »