Sciweavers

895 search results - page 88 / 179
» Approximate convex decomposition
Sort
View
ICCV
2009
IEEE
16 years 2 months ago
Efficient Discriminative Learning of Parts-based Models
Supervised learning of a parts-based model can be for- mulated as an optimization problem with a large (exponen- tial in the number of parts) set of constraints. We show how thi...
M. Pawan Kumar, Andrew Zisserman, Philip H.S. Torr
CVPR
2010
IEEE
15 years 6 months ago
Learning Shift-Invariant Sparse Representation of Actions
A central problem in the analysis of motion capture (Mo- Cap) data is how to decompose motion sequences into primitives. Ideally, a description in terms of primitives should fac...
Yi Li
SIAMJO
2008
86views more  SIAMJO 2008»
14 years 9 months ago
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
Alexandre Belloni, Robert M. Freund
3DGIS
2006
Springer
15 years 3 months ago
Improving the Realism of Existing 3D City Models
Within the paper, a novel approach for the reconstruction of geometric details of building façades is presented. It is based on 3D point clouds from terrestrial laser scanning. B...
Martin Kada, Norbert Haala, Susanne Becker
MOC
1998
73views more  MOC 1998»
14 years 9 months ago
Detecting perfect powers in essentially linear time
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect ...
Daniel J. Bernstein