Sciweavers

680 search results - page 76 / 136
» Complexity of Strict Implication
Sort
View
ECRTS
2010
IEEE
13 years 10 months ago
The Demand Bound Function Interface of Distributed Sporadic Pipelines of Tasks Scheduled by EDF
—In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end...
Nicola Serreli, Giuseppe Lipari, Enrico Bini
DATAMINE
2006
166views more  DATAMINE 2006»
13 years 10 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
ENTCS
2006
173views more  ENTCS 2006»
13 years 10 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
IJCV
2006
206views more  IJCV 2006»
13 years 10 months ago
Highly Accurate Optic Flow Computation with Theoretically Justified Warping
In this paper, we suggest a variational model for optic flow computation based on non-linearised and higher order constancy assumptions. Besides the common grey value constancy ass...
Nils Papenberg, Andrés Bruhn, Thomas Brox, ...
JCP
2008
121views more  JCP 2008»
13 years 10 months ago
Towards Design Space Exploration for Biological Systems
For both embedded systems and biological cell systems, design is a feature that defines their identity. The assembly of different components in designs of both systems can vary wid...
Simon Polstra, Tessa E. Pronk, Andy D. Pimentel, T...