4212 search results - page 140 / 843 » On Compressible Pairings and Their Computation |
171
click to vote
SIGGRAPH
2000
ACM
15 years 10 months ago
2000
ACM
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist o...
180
click to vote
SIGGRAPH
1994
ACM
15 years 10 months ago
1994
ACM
This paper describes a methodology for using the matrix-vector multiply and scan conversion hardware present in many graphics workstations to rapidly approximate the optical flow ...
137
click to vote
SGP
2007
15 years 9 months ago
2007
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
207
click to vote
ICVS
1999
Springer
15 years 10 months ago
1999
Springer
While computing power and transmission bandwidth have both been steadily increasing over the last few years, bandwidth rather than processing power remains the primary bottleneck f...
146
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
A new notion, that of semi-lossless text compression, is introduced, and its applicability in various settings is investigated. First results suggest that it might be hard to explo...