Sciweavers

847 search results - page 136 / 170
» Approximation algorithms for projective clustering
Sort
View
121
Voted
VMV
2004
185views Visualization» more  VMV 2004»
15 years 1 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
109
Voted
CVPR
2006
IEEE
16 years 2 months ago
Automatic Kinematic Chain Building from Feature Trajectories of Articulated Objects
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...
Jingyu Yan, Marc Pollefeys
81
Voted
VIS
2006
IEEE
100views Visualization» more  VIS 2006»
16 years 1 months ago
Visualizing Abstract Data Using Animation
ing Abstract Data Using Animation Amit P. Sawant Department of Computer Science, North Carolina State University Christopher G. Healey Department of Computer Science, North Carolin...
Amit Sawant, Christopher Healey
90
Voted
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
15 years 6 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...
ICPADS
2006
IEEE
15 years 6 months ago
Acceleration of Maximum Likelihood Estimation for Tomosynthesis Mammography
Maximum likelihood (ML) estimation is used during tomosynthesis mammography reconstruction. A single reconstruction involves the processing of highresolution projection images, wh...
Juemin Zhang, Waleed Meleis, David R. Kaeli, Tao W...