Sciweavers

5331 search results - page 694 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
16 years 29 days ago
Cross entropy and adaptive variance scaling in continuous EDA
This paper deals with the adaptive variance scaling issue in continuous Estimation of Distribution Algorithms. A phenomenon is discovered that current adaptive variance scaling me...
Yunpeng Cai, Xiaomin Sun, Hua Xu, Peifa Jia
WEBI
2007
Springer
16 years 27 days ago
Pairwise Constraints-Guided Non-negative Matrix Factorization for Document Clustering
Nonnegative Matrix Factorization (NMF) has been proven to be effective in text mining. However, since NMF is a well-known unsupervised components analysis technique, the existing ...
Yujiu Yang, Bao-Gang Hu
IPPS
2002
IEEE
15 years 11 months ago
A High Performance Algorithm for Incompressible Flows Using Local Solenoidal Functions
The convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number, time s...
Sreekanth R. Sambavaram, Vivek Sarin
180
Voted
ESOP
1999
Springer
15 years 11 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
IJCV
2000
225views more  IJCV 2000»
15 years 6 months ago
Depth from Defocus vs. Stereo: How Different Really Are They?
Depth from Focus (DFF) and Depth from Defocus (DFD) methods are theoretically unified with the geometric triangulation principle. Fundamentally, the depth sensitivities of DFF and ...
Yoav Y. Schechner, Nahum Kiryati