Sciweavers

820 search results - page 120 / 164
» Inducing Temporal Graphs
Sort
View
ICIP
2007
IEEE
16 years 8 days ago
Locally Competitive Algorithms for Sparse Approximation
Practical sparse approximation algorithms (particularly greedy algorithms) suffer two significant drawbacks: they are difficult to implement in hardware, and they are inefficie...
Christopher J. Rozell, Don H. Johnson, Richard G. ...
DSRT
2005
IEEE
15 years 11 months ago
Exploring the Use of Local Consistency Measures as Thresholds for Dead Reckoning Update Packet Generation
Human-to-human interaction across distributed applications requires that sufficient consistency be maintained among participants in the face of network characteristics such as lat...
David J. Roberts, Damien Marshall, Rob Aspin, S&ea...
FORMATS
2003
Springer
15 years 11 months ago
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
AINA
2010
IEEE
15 years 9 months ago
Mnesic Evocation: An Isochron-Based Analysis
—Mnesic evocation occurs under the action of a stimulus. A successful evocation is observed as the overrun of a certain threshold of the neuronal activity followed by a medical i...
Hedi Ben Amor, Jacques Demongeot, Nicolas Glade
FMICS
2008
Springer
15 years 7 months ago
Dynamic Event-Based Runtime Monitoring of Real-Time and Contextual Properties
Given the intractability of exhaustively verifying software, the use of runtime-verification, to verify single execution paths at runtime, is becoming popular. Although the use of ...
Christian Colombo, Gordon J. Pace, Gerardo Schneid...