Sciweavers

676 search results - page 103 / 136
» Sub-stochastic matrix analysis for bounds computation - Theo...
Sort
View
CORR
2011
Springer
186views Education» more  CORR 2011»
12 years 11 months ago
Blind Compressed Sensing Over a Structured Union of Subspaces
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
Jorge Silva, Minhua Chen, Yonina C. Eldar, Guiller...
IOR
2010
112views more  IOR 2010»
13 years 5 months ago
New Policies for the Stochastic Inventory Control Problem with Two Supply Sources
We study an inventory system under periodic review in the presence of two suppliers (or delivery modes). The emergency supplier has a shorter lead-time than the regular supplier, ...
Anshul Sheopuri, Ganesh Janakiraman, Sridhar Sesha...
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
14 years 7 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
IWCIA
2004
Springer
14 years 23 days ago
Minimum-Length Polygon of a Simple Cube-Curve in 3D Space
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
RTSS
2009
IEEE
14 years 2 months ago
Gang EDF Scheduling of Parallel Task Systems
The preemptive real-time scheduling of sporadic parallel task systems is studied. We present an algorithm, called Gang EDF, which applies the Earliest Deadline First (EDF) policy ...
Shinpei Kato, Yutaka Ishikawa