Sciweavers

32 search results - page 2 / 7
» Estimation and clustering with infinite rankings
Sort
View
IBPRIA
2007
Springer
13 years 10 months ago
Motion Segmentation from Feature Trajectories with Missing Data
Abstract. This paper presents a novel approach for motion segmentation from feature trajectories with missing data. It consists of two stages. In the first stage, missing data are...
Carme Julià, Angel Domingo Sappa, Felipe Lu...
CVPR
2011
IEEE
12 years 12 months ago
A Closed Form Solution to Robust Subspace Estimation and Clustering
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
Paolo Favaro, René, Vidal, Avinash Ravichandran
SIGIR
2009
ACM
13 years 11 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
DASFAA
2004
IEEE
123views Database» more  DASFAA 2004»
13 years 8 months ago
A Meta-search Method with Clustering and Term Correlation
A meta-search engine propagates user queries to its participant search engines following a server selection strategy. To facilitate server selection, the metasearch engine must ke...
Dyce Jing Zhao, Dik Lun Lee, Qiong Luo
ICCV
2009
IEEE
14 years 9 months ago
Moving in Stereo: Efficient Structure and Motion Using Lines
We present a fast and robust system for estimating structure and motion using a stereo pair, with straight lines as features. Our first set of contributions are efficient algorit...
Manmohan Chandraker, Jongwoo Lim, David Kriegman