2570 search results - page 129 / 514 » Fast Algorithms For The Computation Of Ranklets |
119
Voted
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Given a spatial data set placed on an n ? n grid, our goal is to find the rectangular regions within which subsets of the data set exhibit anomalous behavior. We develop algorithm...
163
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—We present an application programming interface (API) for the C programming language that facilitates the development of dense linear algebra algorithms on graphics processors a...
134
click to vote
ICCV
2007
IEEE
15 years 9 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
99
Voted
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
We present a fast algorithm for face detection and precise pose estimation. Our detection scheme is based on a tree-structured hierarchy of face vs. background classifiers combine...
164
click to vote
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...