81 search results - page 14 / 17 » A Fast Random Sampling Algorithm for Sparsifying Matrices |
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
PODS
1999
ACM
13 years 12 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
IJCV
2006
13 years 7 months ago
2006
We present a novel framework for motion segmentation that combines the concepts of layer-based methods and feature-based motion estimation. We estimate the initial correspondences...
CIVR
2009
Springer
14 years 2 months ago
2009
Springer
We start from the state-of-the-art Bag of Words pipeline that in the 2008 benchmarks of TRECvid and PASCAL yielded the best performance scores. We have contributed to that pipelin...
IJRR
2011
13 years 2 months ago
2011
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...