Sciweavers

83 search results - page 7 / 17
» Unroll-and-Jam Using Uniformly Generated Sets
Sort
View
FGR
2008
IEEE
153views Biometrics» more  FGR 2008»
14 years 1 months ago
Facial image analysis using local feature adaptation prior to learning
Many facial image analysis methods rely on learningbased techniques such as Adaboost or SVMs to project classifiers based on the selection of local image filters (e.g., Haar and...
Rogerio Feris, Ying-li Tian, Yun Zhai, Arun Hampap...
EUROCOLT
1999
Springer
13 years 11 months ago
Regularized Principal Manifolds
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
Alex J. Smola, Robert C. Williamson, Sebastian Mik...
DMIN
2006
134views Data Mining» more  DMIN 2006»
13 years 9 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
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 7 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
AUSAI
2005
Springer
14 years 29 days ago
Neighborhood Re-structuring in Particle Swarm Optimization
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
Arvind S. Mohais, Rui Mendes, Christopher Ward, Ch...