1330 search results - page 30 / 266 » No Classic Boundary Conditions |
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we show how two classical sparse recovery algorithms, Orthogonal Matching Pursuit and Basis Pursuit, can be naturally extended to recover block-sparse solutions for...
ETFA
2006
IEEE
15 years 1 months ago
2006
IEEE
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...
FLAIRS
2008
14 years 11 months ago
2008
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...
MP
2011
14 years 10 days ago
2011
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
100
click to vote
NHM
2010
14 years 4 months ago
2010
We consider a star-shaped network consisting of a single node with N 3 connected arcs. The dynamics on each arc is governed by the wave equation. The arcs are coupled at the node ...