Sciweavers

495 search results - page 91 / 99
» Approximation algorithms for budgeted learning problems
Sort
View
CGF
2008
192views more  CGF 2008»
14 years 9 months ago
Non-Rigid Registration Under Isometric Deformations
We present a robust and efficient algorithm for the pairwise non-rigid registration of partially overlapping 3D surfaces. Our approach treats non-rigid registration as an optimiza...
Qi-Xing Huang, Bart Adams, Martin Wicke, Leonidas ...
FOCS
2007
IEEE
15 years 4 months ago
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
Parikshit Gopalan, Subhash Khot, Rishi Saket
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 1 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
CVPR
2006
IEEE
15 years 3 months ago
Measure Locally, Reason Globally: Occlusion-sensitive Articulated Pose Estimation
Part-based tree-structured models have been widely used for 2D articulated human pose-estimation. These approaches admit efficient inference algorithms while capturing the import...
Leonid Sigal, Michael J. Black
CVPR
2004
IEEE
15 years 11 months ago
A Graphical Model Framework for Coupling MRFs and Deformable Models
This paper proposes a new framework for image segmentation based on the integration of MRFs and deformable models using graphical models. We first construct a graphical model to r...
Rui Huang, Vladimir Pavlovic, Dimitris N. Metaxas