2593 search results - page 242 / 519 » Algorithms and Data Structures for Computer Topology |
194
click to vote
DCC
2000
IEEE
15 years 11 months ago
2000
IEEE
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
257
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
185
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
170
click to vote
VVS
1996
IEEE
15 years 11 months ago
1996
IEEE
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...
196
click to vote
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...