Sciweavers

1604 search results - page 147 / 321
» Approximation algorithms for developable surfaces
Sort
View
ICIP
2010
IEEE
14 years 11 months ago
Image analysis with regularized Laplacian eigenmaps
Many classes of image data span a low dimensional nonlinear space embedded in the natural high dimensional image space. We adopt and generalize a recently proposed dimensionality ...
Frank Tompkins, Patrick J. Wolfe
SCALESPACE
1997
Springer
15 years 5 months ago
3D Shape Representation: Transforming Polygons into Voxels
We developed a method that transforms a polygonal representation of an object into a voxel representation on a 3D regular grid. By applying scale-space theory we derived expression...
Stijn Oomes, Peter R. Snoeren, Tjeerd Dijkstra
COLING
1992
15 years 2 months ago
Generation of Informative Texts with Style
: An approach to the computational treatment of style is presented in the case of generation of informative texts. We regard the style mestly as a me,as of controlled selection of ...
Stephan M. Kerpedjiev
FOCS
2009
IEEE
15 years 8 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
CVPR
2007
IEEE
16 years 3 months ago
A Fast 3D Correspondence Method for Statistical Shape Modeling
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In this paper, we address this ...
Pahal Dalal, Brent C. Munsell, Song Wang, Jijun Ta...