Sciweavers

187 search results - page 29 / 38
» Relaxed Alternating Projection Methods
Sort
View
DMIN
2006
134views Data Mining» more  DMIN 2006»
13 years 10 months ago
Hyper-Rectangular and k-Nearest-Neighbor Models in Stochastic Discrimination
The stochastic discrimination (SD) theory considers learning as building models of uniform coverage over data distributions. Despite successful trials of the derived SD method in s...
Iryna Skrypnyk, Tin Kam Ho
JUCS
2006
92views more  JUCS 2006»
13 years 8 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa
ICIP
2009
IEEE
13 years 6 months ago
PCA Gaussianization for image processing
The estimation of high-dimensional probability density functions (PDFs) is not an easy task for many image processing applications. The linear models assumed by widely used transf...
Valero Laparra, Gustavo Camps-Valls, Jesús ...
AAAI
2012
11 years 11 months ago
Manifold Warping: Manifold Alignment over Time
Knowledge transfer is computationally challenging, due in part to the curse of dimensionality, compounded by source and target domains expressed using different features (e.g., do...
Hoa Trong Vu, Clifton Carey, Sridhar Mahadevan
CVPR
2008
IEEE
14 years 10 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua