Sciweavers

1917 search results - page 210 / 384
» Compressive Wave Computation
Sort
View
KDD
1995
ACM
193views Data Mining» more  KDD 1995»
15 years 7 months ago
Analyzing the Benefits of Domain Knowledge in Substructure Discovery
Discovering repetitive, interesting, and functional substructures in a structural database improves the ability to interpret and compress the data. However, scientists working wit...
Surnjani Djoko, Diane J. Cook, Lawrence B. Holder
127
Voted
DAC
2005
ACM
15 years 5 months ago
Response compaction with any number of unknowns using a new LFSR architecture
This paper presents a new test response compaction technique with any number of unknown logic values (X’s) in the test response bits. The technique leverages an X-tolerant respo...
Erik H. Volkerink, Subhasish Mitra
129
Voted
DAGSTUHL
2006
15 years 5 months ago
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence fo
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
Boris Ryabko, Jaakko Astola, Alexander Gammerman
160
Voted
AMDO
2010
Springer
15 years 1 months ago
Finding Optimal Parameter Configuration for a Dynamic Triangle Mesh Compressor
This paper proposes a method of rate-distortion optimisation of an algorithm for compressing dynamic 3D triangle meshes. Although many articles regarding compression methods for th...
Oldrich Petrík, Libor Vása
118
Voted
ICIP
2003
IEEE
16 years 5 months ago
Prescient R-D optimized packet dependency management for low-latency video streaming
We present an improved, prescient, scheme to deliver pre-encoded video streams at very low latency. We dynamically manage the prediction dependency for a group of packets using a ...
Yi J. Liang, Bernd Girod