Sciweavers

4315 search results - page 108 / 863
» Sorting in linear time
Sort
View
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
14 years 9 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
TSP
2008
114views more  TSP 2008»
13 years 9 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
JCP
2007
115views more  JCP 2007»
13 years 9 months ago
Toward The Use Of The Time-Warping Principle With Discrete-Time Sequences
Abstract—This paper establishes a new coherent framework to extend the class of unitary warping operators to the case of discrete–time sequences. Providing some a priori consid...
Arnaud Jarrot, Cornel Ioana, André Quinquis
VTC
2006
IEEE
124views Communications» more  VTC 2006»
14 years 3 months ago
Linear Dispersion for Single-Carrier Communications in Frequency Selective Channels
Abstract— Linear dispersion coded orthogonal frequency division multiplexing (LDC-OFDM) has recently been proposed to improve joint frequency and time diversity. This paper inves...
Jinsong Wu, Steven D. Blostein
EOR
2006
104views more  EOR 2006»
13 years 9 months ago
An linear programming based lower bound for the simple assembly line balancing problem
The simple assembly line balancing problem is a classical integer programming problem in operations research. A set of tasks, each one being an indivisible amount of work requirin...
Marc Peeters, Zeger Degraeve