Sciweavers

3670 search results - page 263 / 734
» Linear Recursive Functions
Sort
View
JSC
2000
69views more  JSC 2000»
15 years 6 months ago
Generic Polynomials with Few Parameters
We call a polynomial g(t1, . . . , tm, X) over a field K generic for a group G if it has Galois group G as a polynomial in X, and if every Galois field extension N/L with K L and...
Gregor Kemper, Elena Mattig
TON
2010
118views more  TON 2010»
15 years 4 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho
TSP
2010
15 years 1 months ago
LS-CS-residual (LS-CS): compressive sensing on least squares residual
We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy...
Namrata Vaswani
AUTOMATICA
2002
263views more  AUTOMATICA 2002»
15 years 6 months ago
Analysis of discrete-time piecewise affine and hybrid systems
In this paper we present various algorithms both for stability and performance analysis of discrete-time Piece-Wise Affine (PWA) systems. For stability, different classes of Lyapu...
Giancarlo Ferrari-Trecate, Francesco Alessandro Cu...
IEEEINTERACT
2003
IEEE
15 years 11 months ago
High Performance Code Generation through Lazy Activation Records
For call intensive programs, function calls are major bottlenecks during program execution since they usually force register contents to be spilled into memory. Such register to m...
Manoranjan Satpathy, Rabi N. Mahapatra, Siddharth ...