Sciweavers

3281 search results - page 138 / 657
» Bases for parametrized iterativity
Sort
View
SIAMIS
2010
127views more  SIAMIS 2010»
15 years 4 days ago
Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
We propose two algorithms based on Bregman iteration and operator splitting technique for nonlocal TV regularization problems. The convergence of the algorithms is analyzed and ap...
Xiaoqun Zhang, Martin Burger, Xavier Bresson, Stan...
105
Voted
CVPR
2005
IEEE
16 years 3 months ago
Nonparametric Subspace Analysis for Face Recognition
Linear discriminant analysis (LDA) is a popular face recognition technique. However, an inherent problem with this technique stems from the parametric nature of the scatter matrix...
Zhifeng Li, Wei Liu, Dahua Lin, Xiaoou Tang
DATE
2007
IEEE
150views Hardware» more  DATE 2007»
15 years 8 months ago
Fast memory footprint estimation based on maximal dependency vector calculation
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
Qubo Hu, Arnout Vandecappelle, Per Gunnar Kjeldsbe...
AI
2006
Springer
15 years 5 months ago
Belief Selection in Point-Based Planning Algorithms for POMDPs
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
Masoumeh T. Izadi, Doina Precup, Danielle Azar
CANDC
2005
ACM
15 years 1 months ago
MSAID: multiple sequence alignment based on a measure of information discrepancy
We propose an algorithm of global multiple sequence alignment that is based on a measure of what we call information discrepancy. The algorithm follows a progressive alignment ite...
Min Zhang, Weiwu Fang, Junhua Zhang, Zhongxian Chi