7015 search results - page 976 / 1403 » Approximation algorithms for co-clustering |
163
click to vote
IWVF
2001
Springer
15 years 11 months ago
2001
Springer
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
182
click to vote
RT
2001
Springer
15 years 11 months ago
2001
Springer
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
166
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offse...
156
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
141
click to vote
DCC
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a simple and e ective post-processing method for compressed images. This work focuses on the cyclic time-variance introduced by block-based and subband transfo...