Sciweavers

80 search results - page 11 / 16
» Distributed compression of the plenoptic function
Sort
View
IEEEPACT
2005
IEEE
15 years 8 months ago
A Distributed Control Path Architecture for VLIW Processors
VLIW architectures are popular in embedded systems because they offer high-performance processing at low cost and energy. The major problem with traditional VLIW designs is that t...
Hongtao Zhong, Kevin Fan, Scott A. Mahlke, Michael...
121
Voted
INFOCOM
2005
IEEE
15 years 8 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
140
Voted
LCPC
2007
Springer
15 years 8 months ago
Supporting Huge Address Spaces in a Virtual Machine for Java on a Cluster
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
Ronald Veldema, Michael Philippsen
DCC
2002
IEEE
16 years 2 months ago
On-Line Adaptation in Image Coding with a 2-D Tarp Filter
On-line adaptation to nonstationary distributions is essential to good performance in image coding. Fixed-size contexts (with adaptive tables) are also widely used, in conjunction...
Patrice Simard, David Steinkraus, Henrique S. Malv...
ICASSP
2011
IEEE
14 years 6 months ago
A-Functions: A generalization of Extended Baum-Welch transformations to convex optimization
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
Dimitri Kanevsky, David Nahamoo, Tara N. Sainath, ...