6365 search results - page 236 / 1273 » Fast Local Computation Algorithms |
175
Voted
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
150
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
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 ...
182
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
169
click to vote
DAGSTUHL
2008
15 years 8 months ago
2008
Abstract. A parallel version of the self-verified method for solving linear systems was presented in [19, 18]. In this research we propose improvements aiming at a better performan...
320
click to vote
LCPC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Data copy is an important compiler optimization which dynamically rearranges the layout of arrays by copying their elements into local buffers. Traditionally, array copy...