Sciweavers

8099 search results - page 1187 / 1620
» Higher-Order Task Models
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Exemplar-based Sparse Representation phone identification features
Exemplar-based techniques, such as k-nearest neighbors (kNNs) and Sparse Representations (SRs), can be used to model a test sample from a few training points in a dictionary set. ...
Tara N. Sainath, David Nahamoo, Bhuvana Ramabhadra...
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
14 years 9 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
CVPR
2012
IEEE
13 years 9 months ago
A learning-based framework for depth ordering
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
Zhaoyin Jia, Andrew C. Gallagher, Yao-Jen Chang, T...
ICCV
2009
IEEE
1824views Computer Vision» more  ICCV 2009»
16 years 11 months ago
Beyond the Euclidean distance: Creating effective visual codebooks using the histogram intersection kernel
Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the Euclidean distance to cluster features into visual...
Jianxin Wu, James M. Rehg
ICCV
2009
IEEE
16 years 11 months ago
Subspace Constrained Mean-Shift
Deformable model fitting has been actively pursued in the computer vision community for over a decade. As a result, numerous approaches have been proposed with varying degrees of...
Jason M. Saragih, Simon Lucey, Jeffrey F. Cohn
« Prev « First page 1187 / 1620 Last » Next »