Sciweavers

507 search results - page 59 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
ECCV
2008
Springer
14 years 9 months ago
Temporal Surface Tracking Using Mesh Evolution
In this paper, we address the problem of surface tracking in multiple camera environments and over time sequences. In order to fully track a surface undergoing significant deformat...
Kiran Varanasi, Andrei Zaharescu, Edmond Boyer, Ra...
ECCV
2006
Springer
14 years 9 months ago
Modeling 3D Objects from Stereo Views and Recognizing Them in Photographs
Local appearance models in the neighborhood of salient image features, together with local and/or global geometric constraints, serve as the basis for several recent and effective...
Akash Kushal, Jean Ponce
FOCS
2009
IEEE
14 years 2 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 5 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....
ICCV
2003
IEEE
14 years 9 months ago
A Non-Iterative Greedy Algorithm for Multi-frame Point Correspondence
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
Khurram Shafique, Mubarak Shah