Sciweavers

5169 search results - page 35 / 1034
» Locality approximation using time
Sort
View
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
13 years 9 months ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...
TIP
2011
170views more  TIP 2011»
13 years 2 months ago
A New Hybrid Method for Image Approximation Using the Easy Path Wavelet Transform
The Easy Path Wavelet Transform (EPWT) has recently been proposed by one of the authors as a tool for sparse representations of bivariate functions from discrete data, in particul...
Gerlind Plonka, Stefanie Tenorth, Daniela Rosca
ESANN
2008
13 years 8 months ago
A Method for Time Series Prediction using a Combination of Linear Models
This paper presents a new approach for time series prediction using local dynamic modeling. The proposed method is composed of three blocks: a Time Delay Line that transforms the o...
David Martínez-Rego, Oscar Fontenla-Romero,...
ICA
2004
Springer
14 years 24 days ago
Approximate Joint Diagonalization Using a Natural Gradient Approach
We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, comple...
Arie Yeredor, Andreas Ziehe, Klaus-Robert Mül...
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
14 years 7 months ago
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
Anupam Datta, Sidharth Choudhury, Anupam Basu