Sciweavers

590 search results - page 66 / 118
» Can We Learn to Beat the Best Stock
Sort
View
86
Voted
FGR
2011
IEEE
255views Biometrics» more  FGR 2011»
14 years 1 months ago
Beyond simple features: A large-scale feature search approach to unconstrained face recognition
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
David D. Cox, Nicolas Pinto
CVPR
2008
IEEE
15 years 11 months ago
Parameterized Kernel Principal Component Analysis: Theory and applications to supervised and unsupervised image alignment
Parameterized Appearance Models (PAMs) (e.g. eigentracking, active appearance models, morphable models) use Principal Component Analysis (PCA) to model the shape and appearance of...
Fernando De la Torre, Minh Hoai Nguyen
ICCV
2005
IEEE
15 years 11 months ago
Combining Generative Models and Fisher Kernels for Object Recognition
Learning models for detecting and classifying object categories is a challenging problem in machine vision. While discriminative approaches to learning and classification have, in...
Alex Holub, Max Welling, Pietro Perona
ISCC
2003
IEEE
110views Communications» more  ISCC 2003»
15 years 3 months ago
Intelligent Agents Serving Based On The Society Information
In this paper, we propose a serving system consisting intelligent agents processing society information in a multi-user domain. The agents use the similarity information on the us...
Sanem Sariel, B. Tevfik Akgün
ICML
2004
IEEE
15 years 10 months ago
The multiple multiplicative factor model for collaborative filtering
We describe a class of causal, discrete latent variable models called Multiple Multiplicative Factor models (MMFs). A data vector is represented in the latent space as a vector of...
Benjamin M. Marlin, Richard S. Zemel