Sciweavers

4940 search results - page 52 / 988
» On the Complexity of Universal Programs
Sort
View
TSP
2008
114views more  TSP 2008»
15 years 1 months ago
Universal Switching Linear Least Squares Prediction
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
Suleyman Serdar Kozat, Andrew C. Singer
TSP
2008
69views more  TSP 2008»
15 years 1 months ago
A Frame Construction and a Universal Distortion Bound for Sparse Representations
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
Mehmet Akçakaya, Vahid Tarokh
FI
2011
146views more  FI 2011»
14 years 9 months ago
A Service Oriented Architecture for Personalized Universal Media Access
: Multimedia streaming means delivering continuous data to a plethora of client devices. Besides the actual data transport, this also needs a high degree of content adaptation resp...
Sascha Tönnies, Benjamin Köhncke, Patric...
HIPS
1997
IEEE
15 years 6 months ago
Complexity and Performance in Parallel Programming Languages
Several parallel programming languages, libraries and environments have been developed to ease the task of writing programs for multiprocessors. Proponents of each approach often ...
Steven P. Vanderwiel, Daphna Nathanson, David J. L...