Sciweavers

3373 search results - page 252 / 675
» Linear transformations on codes
Sort
View
SIGGRAPH
2000
ACM
15 years 8 months ago
Progressive geometry compression
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...
Andrei Khodakovsky, Peter Schröder, Wim Sweld...
FASE
1999
Springer
15 years 8 months ago
JTN: A Java-Targeted Graphic Formal Notation for Reactive and Concurrent Systems
JTN is a formal graphic notation for Java-targeted design speci cations, that are speci cations of systems that will be implemented using Java. JTN is aimed to be a part of a more ...
Eva Coscia, Gianna Reggio
DCC
2005
IEEE
16 years 4 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
165
Voted
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 4 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
PERCOM
2009
ACM
15 years 11 months ago
Adaptive Linear Filtering Compression on Realtime Sensor Networks
Abstract—We present a lightweight lossless compression algorithm for realtime sensor networks. Our proposed Adaptive Linear Filtering Compression (ALFC) algorithm performs predic...
Aaron B. Kiely, Mingsen Xu, Wen-Zhan Song, Renjie ...