Sciweavers

4212 search results - page 134 / 843
» On Compressible Pairings and Their Computation
Sort
View
ICPR
2010
IEEE
15 years 9 months ago
Cluster-Pairwise Discriminant Analysis
Pattern recognition problems often suffer from the larger intra-class variation due to situation variations such as pose, walking speed, and clothing variations in gait recognition...
Yasushi Makihara, Yasushi Yagi
RT
2004
Springer
15 years 11 months ago
All-Frequency Relighting of Non-Diffuse Objects using Separable BRDF Approximation
This paper presents a technique, based on pre-computed light transport and separable BRDF approximation, for interactive rendering of non-diffuse objects under all-frequency envir...
Rui Wang 0003, John Tran, David P. Luebke
DAC
2000
ACM
16 years 7 months ago
Code compression for low power embedded system design
erse approaches at all levels of abstraction starting from the physical level up to the system level. Experience shows that a highlevel method may have a larger impact since the de...
Haris Lekatsas, Jörg Henkel, Wayne Wolf
MOBISYS
2003
ACM
16 years 6 months ago
Energy Aware Lossless Data Compression
Wireless transmission of a bit can require over 1000 times more energy than a single 32-bit computation. It would therefore seem desirable to perform significant computation to re...
Kenneth C. Barr, Krste Asanovic
HPDC
2006
IEEE
16 years 15 days ago
Path Grammar Guided Trace Compression and Trace Approximation
Trace-driven simulation is an important technique used in the evaluation of computer architecture innovations. However using it for studying parallel computers and applications is...
Xiaofeng Gao, Allan Snavely, Larry Carter