Sciweavers

7015 search results - page 1057 / 1403
» Approximation algorithms for co-clustering
Sort
View
CGF
1999
159views more  CGF 1999»
15 years 6 months ago
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing th...
João Comba, James T. Klosowski, Nelson L. M...
CGF
1999
79views more  CGF 1999»
15 years 6 months ago
A Practical Analysis of Clustering Strategies for Hierarchical Radiosity
The calculation of radiant energy balance in complex scenes has been made possible by hierarchical radiosity methods based on clustering mechanisms. Although clustering offers an ...
Jean-Marc Hasenfratz, Cyrille Damez, Franço...
189
Voted
NN
1998
Springer
148views Neural Networks» more  NN 1998»
15 years 6 months ago
ARTMAP-IC and medical diagnosis: Instance counting and inconsistent cases
For complex database prediction problems such as medical diagnosis, the ARTMAP-IC neural network adds distributed prediction and category instance counting to the basic fuzzy ARTM...
Gail A. Carpenter, Natalya Markuzon
SAC
2002
ACM
15 years 6 months ago
Location adjustment for the minimum volume ellipsoid estimator
Estimating multivariate location and scatter with both affine equivariance and positive breakdown has always been difficult. A well-known estimator which satisfies both properties...
Christophe Croux, Gentiane Haesbroeck, Peter J. Ro...
TIP
1998
114views more  TIP 1998»
15 years 6 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos
« Prev « First page 1057 / 1403 Last » Next »