Sciweavers

3221 search results - page 373 / 645
» Termination of Linear Programs
Sort
View
ICALP
1990
Springer
15 years 10 months ago
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
David P. Dobkin, David G. Kirkpatrick
ICASSP
2009
IEEE
15 years 10 months ago
Detection of sparse signals under finite-alphabet constraints
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
Zhi Tian, Geert Leus, Vincenzo Lottici
DATE
2004
IEEE
123views Hardware» more  DATE 2004»
15 years 10 months ago
On Concurrent Error Detection with Bounded Latency in FSMs
We discuss the problem of concurrent error detection (CED) with bounded latency in finite state machines (FSMs). The objective of this approach is to reduce the overhead of CED, a...
Sobeeh Almukhaizim, Petros Drineas, Yiorgos Makris
ECOOP
2006
Springer
15 years 10 months ago
Evolution of an Adaptive Middleware Exploiting Architectural Reflection
: Nowadays information systems are required to adapt themselves dynamically to the ever changing environment and requirements. Architectural reflection represents a principled mean...
Francesca Arcelli Fontana, Claudia Raibulet
IFIP
2000
Springer
15 years 10 months ago
PETSc and Overture: Lessons Learned Developing an Interface between Components
We consider two software packages that interact with each other as components: Overture and PETSc. An interface between these two packages could be of tremendous value to applicati...
Kristopher R. Buschelman, William Gropp, Lois C. M...