Sciweavers

7 search results - page 1 / 2
» Elementary differences between the degrees of unsolvability ...
Sort
View
APAL
2010
85views more  APAL 2010»
13 years 5 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
ICMCS
2005
IEEE
124views Multimedia» more  ICMCS 2005»
13 years 10 months ago
Efficient conversion method between subband domain representations
This paper presents an efficient method for the conversion between subband domain representations of different filter banks. It advantageously replaces the conventional cascade of...
Abdellatif Benjelloun Touimi, Adil Mouhssine
OSDI
2008
ACM
14 years 5 months ago
Difference Engine: Harnessing Memory Redundancy in Virtual Machines
Virtual machine monitors (VMMs) are a popular platform for Internet hosting centers and cloud-based compute services. By multiplexing hardware resources among virtual machines (VM...
Diwaker Gupta, Sangmin Lee, Michael Vrable, Stefan...
IROS
2006
IEEE
114views Robotics» more  IROS 2006»
13 years 11 months ago
Simultaneous Motion Compression for Multi-User Extended Range Telepresence
— Extended range telepresence allows a human user to intuitively teleoperate a mobile robot through arbitrarily large remote environments by natural walking. In order to give the...
Patrick Rößler, Uwe D. Hanebeck
ICIP
2010
IEEE
13 years 2 months ago
Compressed sensing of multiview images using disparity compensation
Compressed sensing is applied to multiview image sets and interimage disparity compensation is incorporated into image reconstruction in order to take advantage of the high degree...
Maria Trocan, Thomas Maugey, Eric W. Tramel, James...